Which sorting algorithm is most efficient to use when the underlying system takes trivial time to copy values, but way more to compare among them? from insertion quick, heap and merge one
Asked
Active
Viewed 40 times
0
-
https://en.wikipedia.org/wiki/Sorting_algorithm#Comparison_of_algorithms – MadScientist Dec 15 '20 at 11:38
-
Incidentally, with the marked dup, read past the accepted answer. Another answer provides a better option for reducing number of comparison. (And there is the tongue-in-cheek sleep-sort). – Peter Dec 15 '20 at 11:47