@bohica61 said:
Tell him if he can't design a sort algorithm with consistently better performance than a quicksort, his next performance review will not go well.
Actually, quick-sort only works well up to around 10,000 items. After that, I've found that I get better performance by breaking the data up into 10,000-item chunks, quicksorting each, then merge-sorting the chunks - using multiple passes of merge-sort if needed.