Mail Archives: djgpp/1997/07/02/08:21:23
If you are using linked lists I would recommed using MergeSort, it's
really fast.
On Tue, 1 Jul 1997, Benjamin D Chambers wrote:
> Generally, is qsort pretty fast?
>
> I had been planning to sort my list using a double linked list, starting
> each time from the previously entered element (since elements tend to
> come in bunches near each other), but would the effort be worth it when I
> could use qsort? (Or am I going to get the standard "Time it and see"
> answer? :)
>
> ...Chambers
>
- Raw text -