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

>>6
I would fold the paper such that its length is halved repeatedly until the one inch marker is longer. The number of folds is the result.