Re: [RFC] 2.5.8 sort kernel tables

[Alan Cox]

> 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)