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

>>33
Well it's hard to tell when you say things that probably are true, although somewhat baseless.

I find sleep sort to be decently thought provoking. It's a good example of what is and isn't allowed when you do high level programming. I.e. it's the equivalent of saying ALRIGHT NOW SORT THIS LIST IN O(n) time GO.