Path: utzoo!mnetor!uunet!lll-winken!lll-tis!ames!mailrus!tut.cis.ohio-state.edu!bloom-beacon!mit-eddie!rutgers!rochester!ken
From: ken@cs.rochester.edu (Ken Yap)
Newsgroups: comp.society.futures
Subject: Re: What to do with all those MIPS
Message-ID: <8804@sol.ARPA>
Date: 19 Apr 88 22:45:22 GMT
References: <8804191539.AA00968@lll-crg.llnl.gov>
Reply-To: ken@cs.rochester.edu (Ken Yap)
Organization: U of Rochester, CS Dept, Rochester, NY
Lines: 9

|2) Why not use the simplest sorting algorithms all the time, if CPU is easy
|   to come by?

Because an O(n log n) sort will still handle a million elements
decently, while your quadratic sort will be running till the the next
eclipse of the moon, even if you have a Cray. And besides, what's so
complicated about mergesort? I still have problems understanding
shellsort.

	Ken