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

>>43
The way you made the "suggestion" (repeated demand) was childish, but not quite as childish as just about everything else you said. If anything, you should go elsewhere and tripfag-sama should stick around.

CBF to care either way though.