Hi!
9--2004 05:02 [EMAIL PROTECTED] (Eric Auer) wrote to
[EMAIL PROTECTED]:
EA Hi, I would like to add that:
EA http://www.wordiq.com/definition/Quicksort
EA Quicksort takes average O(n*log(n)) but worst O(n*n) comparisons,
If you get medium item from fixed position, you always may
At 05:09 PM 7/10/2004 +0400, Arkady V.Belousov wrote:
Hi!
8-éÀÌ-2004 22:10 [EMAIL PROTECTED] (Michael Devore) wrote to
[EMAIL PROTECTED]:
MD I only know of one original pmode CWSORT and it a) doesn't use DJGPP
and b)
MD uses a shell sort which doesn't consume indefinite amounts of stack.
1.
Hi, I would like to add that:
http://www.wordiq.com/definition/Quicksort
Quicksort takes average O(n*log(n)) but worst O(n*n) comparisons,
and average O(log n) but worst O(n) stack (and no head)...
So I increased stack size of SORT to 16k, which means that it can
sort up to 700 (roughly)
