Re:Big-O Algorithm Complexity Cheat Sheet
by anonymoushn on Saturday May 04, 2013 @01:16PM
(#5655519)
The math behind this stuff is in the first third of most calculus textbooks. The CS half can be found in CLRS. You can also probably learn it from TopCoder tutorials or usacogate (I recall there being a mirror of usacogate that did not require you to do all of the problems in order to advance).
[ Parent
| on HN ]
Re:Big-O Algorithm Complexity Cheat Sheet
by henrikschroder on Saturday May 04, 2013 @01:24PM
(#5655557)
CLRS? Why you young whippersnapper! Back in my day it was called CLR, and those three letters were good enough for us! Kids these days...
mmanfrin, it's this book: http://en.wikipedia.org/wiki/Introduction_to_Algorithms
The book along was a little terse for me. The videos from OCW however are priceless, even entertaining sometimes.[1]
[1] http://ocw.mit.edu/courses/electrical-engineering-and-comput...
I'm very bad at calculus , but I can work out Big O intuitively quite easily.
Even average case complexity?
Enough to guess with a fairly high degree of accuracy.
Only for the simple stuff (and that might be good enough for you). Average case complexity is devilishly hard in general, and even worst case complexity is super hard. E.g. try analysing fibonacci heaps `intuitively'.