Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!thunder.mcrcim.mcgill.edu!snorkelwacker.mit.edu!mintaka!olivea!uunet!munnari.oz.au!manuel!ccadfa!prolix!dac From: dac@prolix.pub.uu.oz.au (Andrew Clayton) Newsgroups: comp.sys.amiga.programmer Subject: Re: Combsort algorithm Message-ID: <191c1d82.ARN1dba@prolix.pub.uu.oz.au> Date: 8 May 91 10:16:02 GMT References: <1193@cbmger.UUCP> <1991May3.201243.7959@watdragon.waterloo.edu> <1991May6.155148.1201@zorch.SF-Bay.ORG> Reply-To: dac@prolix.pub.uu.oz.au Followup-To: comp.sys.amiga.programmer Organization: More like Mis~, really. Lines: 31 In article , Mike (My Watch Has Windows writes: > In article <1991May6.155148.1201@zorch.SF-Bay.ORG> xanthian@zorch.SF-Bay.ORG (Kent Paul Dolan) writes: > While it does (barely) beat heapsort, it takes almost twice as long > as quicksort, so it is still not a choice you'd make except in a small > sort, quick hack application. > > Actually, for that kind of application, I use sort(). What's the point > of having libraries of tools if you don't use them for the quick > hacks. In fact, even for non-quick hacks, it's probably worthwhile > using sort(), and replacing it if it proves to be unsuitable for some > reason. If you want a sad laugh; Mickeysoft C V6.00 for the MSDOS platform has a sort() library function, all very well and good. Microsoft Windows (V3) has listboxes that can be flagged as 'sorted'. Fine. Unfortunately, Windows doesn't use the sort() library - it has its OWN completely incompatible collating sequence that places all punctuation and special symbols BEFORE letters, and all the numerals AFTER letters. It's truly spasticated, and a real bitch to work with. Grr. > I know the world is flat. Mike Meyer Dac --