Subj : Re: Arranging the keys problem
To   : comp.programming
From : Willem
Date : Fri Sep 30 2005 12:10 pm

Lars wrote:
) 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).

In the case of only three different elements, Quicksort *is* O(n).
You don't even need any tweaking.


SaSW, Willem
-- 
Disclaimer: I am in no way responsible for any of the statements
            made in the above text. For all I know I might be
            drugged or something..
            No I'm not paranoid. You all think I'm paranoid, don't you !
#EOT

.