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

>>14
Well I disagree with your opinion about tripcodes. Insufferable fagstorms as you call them are caused by shitposting trippers. I tried to write that post with genuine quality, and you can see that. Also, this is my site wide tripcode. I use it for a variety of reasons that happen to not include shittposting and posting for attention. Don't you worry, I won't be here very long, I'm just visiting.

>>15
Even worse, name != tripcode. At least before you were in the right super class, you're devolving. And no /prog/ sucks and you should feel bad. /g/ isn't full of a bunch of morons talking about  Jews and random other crap.

>>22
So MIT and Caltech uses it because?

>>24
Yeah I could have simplified it, but I wanted to include everything that would make it a formal proof, and why those things would be necessary for the full argument. In my experience, at least in the beginning of courses, you have to include each of these items. And in fact I skipped out on formal loop invariants. Proofs for academia tend to be fairly long and verbose, as you probably know.