🚀 go-pugleaf

In article <1992Nov8.012628.23338@menudo.uh.edu> libh@Jane.UH.EDU writes:
>  The bubble sort takes N! (# factorial) steps, rather than N*N steps.  A BIG
>difference.  But as pointed out, the quicksort is the easiest to implement
>since it is in C libraries.  Why reinvent the wheel.  If that isn't quick
>enough then I would check out Knuth's 'Art of Programming' Vol. 3 since it is
>pretty much only about sorting.
>
nope.its worst case is n*n where n is the number of items in the list...
you have to watch the quicksort with lists of objects which are already
sorted, because its performance on a sorted list is a lot worse than
the bubble sort. on a presorted list , the quicksort will also use
in the order of n stack space. This could be prevented by taking a different
pivot element when quicksorting (like the middle one). the library quicksort
uses the first element.