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

>>11
Vanity tripcodes != unsecure tripcodes, and this in fact, is not the former. Unless of course you consider 'pQsULI4sXc' to hold some kind of special meaning. I guess only 'imageboard retards' know of such nuances. Let me guess, another one of those kids who doesn't like /g/ or the rest of 4chan, because /prog/ is OH SO MUCH BETTER.