lkml.org 
[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
Date
From
> Any real-world figures on how long this sort process would take on big
> tables on some sparc or i586 class box? (Just trying to figure if bubble
> is really adequate. It is if the table is indeed essentially sorted with
> only like 10 reversed neighbours or if it's short.)

If the table is 90% ordered an insertion sort searching from tail is even
more efficient for the general case and just as simple. Its still arguing
about milliseconds 8)
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/

\
 
 \ /
  Last update: 2005-03-22 13:25    [from the cache]
©2003-2011 Jasper Spaans