Article View: comp.lang.modula2
Article #247Re: Sorts
From: "MARK GOODERUM - UNIV. OF KANSAS...
Date: Tue, 12 Sep 1989 04:06
Date: Tue, 12 Sep 1989 04:06
16 lines
1132 bytes
1132 bytes
>Bubble sort? Surely nobody has ever used bubble sort ... Except maybe a non-computerese technical person hacking out quick programs. My poor friend the ME major couldn't figure out why the simple little program he wrote to sort 10000 or so lines of a parts list by differnet numbers took so long... Oh well. "The book showed it so it must be okay..." But what sort to use as we all (should) know depends on many factors, which is why answering the original question in anything mor than a vague reply was difficult. My personal favorite is Heapsort or Binary Insertion (what I think you refer to as Merge) sorting. Cordially, Mark Gooderum MARKV@UKANVAX
Technical Details
Message-ID:
<INFO-M2%89091200124914@UCF1VM>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!tut.cis.ohio-state.edu!ucbvax!UKANVAX.BITNET!MARKVShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!tut.cis.ohio-state.edu!ucbvax!UKANVAX.BITNET!MARKV
From: MARKV@UKANVAX.BITNET ("MARK GOODERUM - UNIV. OF KANSAS ACS - MARKV@UKANVAX")
Newsgroups: comp.lang.modula2
Subject: Re: Sorts
Message-ID: <INFO-M2%89091200124914@UCF1VM>
Date: 12 Sep 89 04:06:00 GMT
Sender: daemon@ucbvax.BERKELEY.EDU
Reply-To: Modula2 List <INFO-M2%UCF1VM.bitnet@jade.berkeley.edu>
Organization: The Internet
Lines: 16