Engineers· 32-bit
Checking items one by one takes n steps. Halving a sorted list takes only log n.
Bit
I can do three billion simple steps a second. That sounds like enough for anything. It isn't. Give me a bad method and a big enough problem and I'll still be working when the Sun burns out. Let me show you why the method matters more than my speed.