I think Insertion sort tends to be the most natural sort for doing things like s...

		iofthestorm on June 22, 2009 \| parent \| context \| favorite \| on: Bead sort: faster than O(N log N) sort 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.