You can't just randomize the comparison operation, since that'd violate the requirements of a comparison function. MS made that mistake in their browser downloa

You can't just randomize the comparison operation, since that'd violate the requirements of a comparison function. MS made that mistake in their browser download dialog, which led to significant biases. You'd need to assign a random number to each item. But then you'd need to figure out a way to store this random number. Also, for in-memory data comparison-based sorting is much slower than shuffling. Both asymptotically (O(n log n) vs O(n)) and in practice. I did not investigate if sorting algorithms not based on comparisons (e.g. radix sort) have competitive performance. https://www.computerworld.com/article/2762287/microsoft-s-eu-ballot-fails-to-randomize-browser-order.html https://www.computerworld.com/article/2762287/microsoft-s-eu...