🧠
your local smart kid.
Let f(n) and g(n) be functions from Z+ to R.
f(n) := O(g) if f(n) <= c * g(n), n >= n0.
O(g) is g steps to n input size.
Algorithm is steps that do stuff.
- Shenzhen
- https://shorter.tuxe.do
Sort by: Most downloads
0 packages
No results matched your search.
Try browsing all packages to find what you're looking for.