10 points | by signa11 2 days ago ago
1 comments
Quicksort is quick because it's space requirements are not just linear but very very close to n. It is quick because it minimizes IO.
To be clear I did not look at the code, but benchmarking against 50 million items makes me suspect that minimal IO was required.
Now sure, sometimes that is exactly your use case. But for many interestingly sized problems, IO dominates.
Quicksort is quick because it's space requirements are not just linear but very very close to n. It is quick because it minimizes IO.
To be clear I did not look at the code, but benchmarking against 50 million items makes me suspect that minimal IO was required.
Now sure, sometimes that is exactly your use case. But for many interestingly sized problems, IO dominates.