All notes/ efficient-code

go back / go search

Logarithms

Let’s examine why algorithms such as binary search are described as O(log N).

Print all even numbers from 2 to 100