News for hackers. Stuff that matters.
Re:Bead sort: faster than O(N log N) sort by stcredzero on Monday June 22, 2009 @07:55AM (#668593)
http://en.wikipedia.org/wiki/Spaghetti_sort

The advantages of this sort:

1) It involves something ridiculous (in the CS context) like Pasta.

2) You have an excuse to play the theme from "The Good, The Bad, and The Ugly" in that section of the talk.

There are no comments on this comment yet.