[lkml]   [2002]   [Apr]   [18]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: [RFC] 2.5.8 sort kernel tables (William Lee Irwin III)  wrote on 18.04.02 in <>:
>> 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.

To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to
More majordomo info at
Please read the FAQ at

 \ /
  Last update: 2005-03-22 13:25    [W:0.087 / U:0.652 seconds]
©2003-2018 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site