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

>>10
Your post was helpful.

But you should refrain from using vanity tripcodes here, it's something only imageboard retards and redditors would do.

>>13
Yes, I'm one of those kids, /g/ is fucking shit. /prog/ is so much better, indeed.

I'm not bothered by your presence, in fact your post was good. But please remove your name, it doesn't contribute anything to the conversation and even if it's a ``meaningless'' tripcode, you know what consequences this might bring in the future (namely, becoming an insufferable fagstorm). Moreover, a tripcode is not strictly necessary here, you don't need to prove your identity to be helpful.

There's no need to act up like that, I was just making a recommendation.