The Big Oh

The funniest (if you too think geek to be funny) explanation of why we need to use the O(n) notation to analyze the performance of algorithms.

http://www.crsr.net/Notes/BigO.html

Comments