Re: quicksort for linked list

From: Alan Cox (alan@lxorguk.ukuu.org.uk)
Date: Fri Mar 09 2001 - 06:50:44 EST


> Quicksort works just fine on a linked list, as long as you broaden
> your view beyond the common array-based implementations. See
> "http://www.cs.cmu.edu/~jbruce/sort.cc" for an example, although I
> would recommend using a radix sort for linked lists in most situations
> (sorry for the C++, but it was handy...).

In a network environment however its not so good. Quicksort has an N^2
worst case and the input is controlled by a potential enemy.

Im dubious about anyone doing more than simple bucket sorting for packets.

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



This archive was generated by hypermail 2b29 : Thu Mar 15 2001 - 21:00:10 EST