Re: [RFC] 2.5.8 sort kernel tables

[William Lee Irwin III]

[e-mail] (William Lee Irwin III)  wrote on 18.04.02 in <[e-mail]>:
>> It doesn't have to be an O(n lg(n)) method but could you use something
>> besides bubblesort? Insertion sort, selection sort, etc. are just as
>> easy and they don't have the horrific stigma of being "the worst sorting
>> algorithm ever" etc.

On Thu, Apr 18, 2002 at 08:16:00PM +0200, Kai Henningsen wrote:
> Surely the worst (working) sort is randomsort? (Check if sorted. If not,  
> pick two entries at random, exchange, retry.)

Perhaps I should have qualified it with "plausible" or something. The
intent is clear regardless.

Cheers,
Bill