In college, i invented a new sort algorithm... I dubbed RobSort.  I demonstrated my creation in sparc assembly one year... and later demonstrated it again, animated using various techniques learned in my graphics class.  Essentially the algorithm is:

while my numbers are out of order, swap two of them at random.

It was the fastest algorithm possible if your numbers were already sorted.  It was ok on single digit arrays... but around 13 or 14... well, I flatlined a sparcstation for many hours before giving up.

Today's XKCD reminded me of this.  Good times.
Shared publiclyView activity