|
|
|
|
|
|
by zug_zug
41 days ago
|
|
|
I'd like to point out that all the graphs only go to 4,000 elements, which is basically non-data. Basically it'd be like measuring which car wins a 1cm race. For small workloads binary search is slower than just checking every element. To add to this, I think people can forget how small log(n) is... it can practically be seen as constant (as the log base 2 of ATOMS IN THE UNIVERSE is ~300). |
|
|