It can be extremely biased, and the results can depend on the sort algorithm, because what you&#x27;re randomizing is the comparison results, not the order. Consider insertion sort: <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Insertion_sort" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Insertion_sort</a><p>As the list is sorted, elements are inserted from the back by finding the first element that the new element is smaller than. The last element to be inserted is the one at the end of the unsorted array, and, with a random comparator, it has a 50% chance of being &quot;larger&quot; than the biggest of the rest of the elements, and thus remaining at the end of the list.<p>Microsoft used this technique to &quot;randomize&quot; a list of browsers back in 2010, but, when viewing the page in IE, it ended up putting IE in the last position (out of a set of five browsers) 50% of the time: <a href="http:&#x2F;&#x2F;www.robweir.com&#x2F;blog&#x2F;2010&#x2F;02&#x2F;microsoft-random-browser-ballot.html" rel="nofollow">http:&#x2F;&#x2F;www.robweir.com&#x2F;blog&#x2F;2010&#x2F;02&#x2F;microsoft-random-browser...</a>