Subj : Re: Arranging the keys problem
To   : comp.programming
From : Lars Weber
Date : Fri Sep 30 2005 02:22 am

Hi Willem,

You're wrong.
Quicksort is not of linear runtime.
In worstcase it's O(nē) and in the average it's O(n log n).

Have a look here to get more information:
http://en.wikipedia.org/wiki/Sorting_algorithms#List_of_sorting_algorithms

Greetings,
Lars

Willem wrote:

> 
> Quicksort.  You may need a slight tweak to make it linear time.
> 

--
The only easy day way yesterday...

.