News for hackers. Stuff that matters.
Re:On Binary Search by thethirdone on Thursday October 31, 2019 @08:45AM (#21408110)
Nitpick on Nitpick on Nitpick, it is indeed O(2^m) and not O(e^m). Those are not the same complexity.

Logs get to not care, but when we exponentiate it matters.

There are no comments on this comment yet.