[seqfan] Re: slowest-growing "accelerating" sequence

[franktaw at netscape.net]

The slowest I ever heard of anyone actually implementing is bubble sort 
where you start over every time you get a swap. That's an n^3 algorithm.

Franklin T. Adams-Watters

-----Original Message-----
From: Ron Hardin <rhhardin at att.net>

Only semi-related, there was a contest at work once to come up with the 
slowest
sort algorithm.

I don't remember what won.
 
rhhardin at mindspring.com
rhhardin at att.net (either)