Bead sort: faster than O(N log N) sort

Re:Bead sort: faster than O(N log N) sort by ars on Monday June 22, 2009 @02:31AM (#668339)

Is there any theory on analyzing sorting real world objects? Like playing cards.

In a computer, picking the n'th item in an array is O(1), in the physical world it's O(n). In a computer inserting an item is O(n), but in the physical world it's O(1).

Are there any good algorithms for sorting playing cards?

[ Parent | on HN ]

Re:Bead sort: faster than O(N log N) sort by iofthestorm on Monday June 22, 2009 @03:26AM (#668389)

I think Insertion sort tends to be the most natural sort for doing things like sorting playing cards. Anything else seems like it would be more of a hassle than it would be worth in real life.

[ Parent | on HN ]