From: an096 AT yfn DOT ysu DOT edu (David A. Scott)
Newsgroups: comp.os.msdos.djgpp
Subject: Re: Sorting Algorythums
Date: 6 Mar 1998 11:56:36 GMT
Organization: St. Elizabeth Hospital, Youngstown, OH
Lines: 39
Message-ID: <6doo9k$pq0$1@news.ysu.edu>
References: <34FF5684 DOT 2772E87C AT po-box DOT mcgill DOT ca> <34F113BA DOT 203AD4E9 AT earthlink DOT net> <6cv625$7o6 AT ds2 DOT acs DOT ucalgary DOT ca>
Reply-To: an096 AT yfn DOT ysu DOT edu (David A. Scott)
NNTP-Posting-Host: yfn2.ysu.edu
To: djgpp AT delorie DOT com
DJ-Gateway: from newsgroup comp.os.msdos.djgpp
Precedence: bulk


In a previous article, nospam AT po-box DOT mcgill DOT ca (Patrick Griffiths) says:

>The lower bound on general sorting is O(nlog(n)).
>The merge sort algorithm accomplishes this in the worst case,
  The heap sort is also 0(n log(n)) ib every case, The storage
requirments are less than merge. I have used both and like heap 
the best.

>quick sort in the average case.  Quick sort is O(n^2) in the
>worst case.  Radix and Bucket sort are indeed O(n), but like
>Paul says, they make assumptions about the data set.
>
>Patrick
>
>Paul Szuch wrote:
>
>> Don't forget Radix or Bucket sorts both are the fastest I know of at
>> O(N) but have some special requirements. Radix will only compare
>> integers and bucket requires temporary storage.
>>
>> On Sun, 22 Feb 1998 22:14:18 -0800, "STEVEN S. FALLS"
>> <broadview AT earthlink DOT net> wrote:
>>
>> >    What is the best sorting algorythm and what is it. I mean, how would
>> >one program the algrothym?
>> >            Thanks,
>> >                        -Ardy
>> >
>
>
>
>

-- 
http://cryptography.org under /Misc location of scott16u.zip and now
the location of scott4u.zip so enter the contest it uses 40bit key so
someone should win by brute force written to test ideas of 16u but key
space thousands of times smaller. And is thousands of times easier to solve