3 ms·
> You're better off doing a linear search which guarantees you'll spend less than 2,000x searching the space. Almost. If only the last commit is slow, binary s
by jwilk 3y ago
> You're better off doing a linear search which guarantees you'll spend less than 2,000x searching the space.
Almost. If only the last commit is slow, binary search is still faster.
- bgirard 3y ago> better off Better off as in expected/average case. Good point, but only marginally better in the worse case.