[lkml]   [2005]   [Jan]   [22]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
    SubjectRe: [patch 1/13] Qsort
    > How about a shell sort?  if the data is mostly sorted shell sort beats 
    > qsort lots of times, and since the data sets are often small in-kernel,
    > shell sorts O(n^2) behaviour won't harm it too much, shell sort is also
    > faster if the data is already completely sorted. Shell sort is certainly
    > not the simplest algorithm around, but I think (without having done any
    > tests) that it would probably do pretty well for in-kernel use... Then
    > again, I've known to be wrong :)

    I like shell sort for small data sets too. And I agree it would be
    appropiate for the kernel.

    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 14:09    [W:0.018 / U:21.856 seconds]
    ©2003-2016 Jasper Spaans. hosted at Digital OceanAdvertise on this site