John Doe

https://shorter.tuxe.do

Shenzhen 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.