Big O!
Created on: September 28th, 2006
Big O!

Sponsorships:

Vote metrics:

rating total votes favorites comments
(3.86) 7 0 4

View metrics:

today yesterday this week this month all time
0 0 0 0 1,142

Inbound links:

views url
52 https://www.bing.com
8 http://216.18.188.175:80
6 http://www.google.com.hk
2 https://www.google.com/
1 http://www.google.com/search?sourceid=navclient&ie=UTF-8&rlz=1T4

Add a comment

Please login or register to comment.
September 28th, 2006
(0)
Not bad, not good. Bonus for tite music.
September 28th, 2006
(0)
Umm, I don't get it.
September 28th, 2006
(0)
Chart lacks n*n!, thus loses for not having the most inefficient algorithm
September 28th, 2006
(0)
I'm pretty sure you can make functions that grow faster than n*n!, sir. n*n! is hardly worse than n!.