4 ms·
If I ask you whether your sort can be made faster, and you can make a credible case that it's O(n log n), so no, I'm happy.
by pklausler 11y ago
If I ask you whether your sort can be made faster, and you can make a credible case that it's O(n log n), so no, I'm happy.