Content deleted Content added
Line 287:
Are info or comments about best '''physical-sort''' algorithms appropriate here? What differences apply due to human or mechanical vs electronic/cyber media and speeds? [[User:HalFonts|HalFonts]] ([[User talk:HalFonts|talk]]) 07:20, 19 November 2010 (UTC)
:It is usual to measure comparison sorting algorithms based on the number of comparisons, and assume that the number of element moves (or copies) is proportional. As a physical sort problem, consider sorting a deck of playing cards, commonly by insertion sort. Unlike for EDP, a whole group of already sorted cards moves up or down as one operation. I did once, just to see that I could do it, sort a deck of cards with quicksort. Some EDP sort algorithms easily adapt as physical sort algorithms, and others don't. Reminds me, that radix sort was commonly used to sort decks of computer cards in the early EDP days. There were machines built to do this combination of electronic and physical sorting. [[User:Gah4|Gah4]] ([[User talk:Gah4|talk]]) 13:44, 4 September 2019 (UTC)
== TimSort ==
| |||