CS

How can i into Algorithm complexity analysis?

example:
How do i formally prove that the Binary Search is O(log(n)) on sorted arrays?

How fib(n) solved in a naive recursive way is O(2^n])?

Mathematically that's

>>31
Oh uh... you took that more seriously than anticipated. I will level with you, I have never made a completely serious post on /prog/ that wasn't entirely code and/or totally absorbed in discussion of a programming concept.

The sleepsort thread had some hilarious moments. For something with real content, try http://dis.4chan.org/read/prog/1260419313

That thread is full of shit, but has some conversation on FM and even details for implementing an FM synth.