Re:Big-O notation explained by a self-taught programmer
by Retric on Saturday July 27, 2013 @05:13AM
(#6112319)
Suppose you had three functions.
For really big numbers both F1 and F2 are faster but at n = 100 F3 has a huge lead and for say n = 1 billion F3 beats F1 but not F2.
[ Parent
| on HN ]
There are no comments on this comment yet.