lkml.org 
[lkml]   [2005]   [Jan]   [24]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
    /
    SubjectRe: [patch 1/13] Qsort
    From
    Date
    On Sul, 2005-01-23 at 05:05, Jesper Juhl wrote:
    > On Sun, 23 Jan 2005, Andi Kleen wrote:
    > Even with large data sets that are mostly unsorted shell sorts performance
    > is close to qsort, and there's an optimization that gives it O(n^(3/2))
    > runtime (IIRC), and another nice property is that it's iterative so it
    > doesn't eat up stack space (as oposed to qsort which is recursive and eats
    > stack like ****)...

    qsort also has bad worst case performance which matters if you are
    sorting data provided by a hostile source.

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