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

I agree 100% with everything in this article. As a non-Japanese 2channeler living in Japan, I have a special appreciation for anonymous posting; when I post on 2ch, my words are not those of a “gaijin,” but just those of another nanashi-san. It’s the only time I can be completely at ease about my identity as a foreigner. As a matter of fact, when I DO claim that I am not Japanese, people often accuse me of “tsuri” (trolling), i.e. they think that I am a Japanese pretending to be a gaijin.