codementor on Nostr: Only about 10 more. log₂ of 1,000 is about 10, and log₂ of 1,000,000 is about 20. ...

Only about 10 more.

log₂ of 1,000 is about 10, and log₂ of 1,000,000 is about 20. The input grew 1,000 times, but the steps only doubled. That is why O(log n) algorithms are so fast on big inputs.

#big006 · BIG-006-A1