News for hackers. Stuff that matters.

A comment on Bead sort: faster than O(N log N) sort. Parent comment

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 ]

There are no comments on this comment yet.