parent
f2aa0f8544
commit
e0abf4ec21
6 changed files with 32 additions and 9 deletions
@ -0,0 +1,5 @@ |
|||||||
|
Asymptotic notation is the standard way of measuring the time and space that an algorithm will consume as the input grows. In one of my last guides, I covered "Big-O notation" and a lot of you asked for a similar one for Asymptotic notation. You can find the [previous guide here](/guides/big-o-notation). |
||||||
|
|
||||||
|
![](/guides/asymptotic-notation.png) |
||||||
|
|
||||||
|
Here is the [original tweet](https://twitter.com/kamranahmedse/status/1243861514907418624) where this image was posted. |
@ -1,3 +1,5 @@ |
|||||||
Random numbers are everywhere from computer games to lottery systems, graphics software, statistical sampling, computer simulation and cryptography. Graphic below is a quick explanation to how the random numbers are generated and why they may not be truly random. |
Random numbers are everywhere from computer games to lottery systems, graphics software, statistical sampling, computer simulation and cryptography. Graphic below is a quick explanation to how the random numbers are generated and why they may not be truly random. |
||||||
|
|
||||||
![](/guides/random-numbers.png) |
![](/guides/random-numbers.png) |
||||||
|
|
||||||
|
Here is the [original tweet](https://twitter.com/kamranahmedse/status/1237851549302312962) where this image was posted. |
||||||
|
After Width: | Height: | Size: 987 KiB |
Loading…
Reference in new issue