🧠
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
Popular repositories Loading
-
-
-
FuckEnglishIO
FuckEnglishIO PublicA tool to help struggling and dying IB English A: Language and Literature students to grind questions on IO or do a practice IO under exam conditions.
Python 2
-
Something went wrong, please refresh the page to try again.
If the problem persists, check the GitHub status page or contact support.
If the problem persists, check the GitHub status page or contact support.