From: Damian Yerrick Newsgroups: comp.os.msdos.djgpp Subject: qsort's algorithm Organization: Pin Eight Software http://pineight.8m.com/ Message-ID: X-Newsreader: Forte Agent 1.7/32.534 MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Lines: 11 X-Trace: /wsFGz/o+fdcMDq1vTba1SuRhFpn0LLL+Cq7IOIGuVo+3L9Qi1RGMRGsk44JPBxm0Pbf2spSF5a4!lyerpFzvZvlbfGBLkhZVvLTLTDfQWkJ4mh0sVviHPhDC4XbEy7u8oYgMKzrg3H5tXUkW4SO2cREN!BTJgSQ== X-Complaints-To: abuse AT gte DOT net X-Abuse-Info: Please be sure to forward a copy of ALL headers X-Abuse-Info: Otherwise we will be unable to process your complaint properly NNTP-Posting-Date: Wed, 18 Oct 2000 03:02:12 GMT Distribution: world Date: Wed, 18 Oct 2000 03:02:12 GMT To: djgpp AT delorie DOT com DJ-Gateway: from newsgroup comp.os.msdos.djgpp Reply-To: djgpp AT delorie DOT com From what I understand of the C standard, qsort() can use any decent sorting algorithm. Does DJGPP libc's qsort() have bad performance on already sorted data? --