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

>>27
Alright I see, it has some valuable content.

I'm not self conscious, like I said, I've been tripping site wide, and have been for a while now. If it wasn't painfully obvious by the name, I'm from /a/ and /v/ and /sci/ and I'm branching out. I don't think I'll ever get used to the shitposting, that usually gets deleted on the image boards or shit on by angry posters.

Well thanks for the link anyways.