Path: csiph.com!x330-a1.tempe.blueboxinc.net!usenet.pasdenom.info!gegeweb.org!news.glorb.com!newsgate.cuhk.edu.hk!news.netfront.net!not-for-mail From: Wanja Gayk Newsgroups: comp.lang.java.programmer Subject: Re: Using Java Classes to Sort a Small Array Quickly Date: Sat, 17 Sep 2011 16:53:50 +0200 Organization: Netfront http://www.netfront.net/ Lines: 23 Message-ID: References: <86c4a53b-1ca1-48a8-b954-c01bd449278a@s35g2000prm.googlegroups.com> <4e6d5bf5$0$316$14726298@news.sunsite.dk> <4e6e9217$0$308$14726298@news.sunsite.dk> <900ffdda-7170-44e3-a141-bfec09c74dd1@glegroupsg2000goo.googlegroups.com> NNTP-Posting-Host: 77.8.37.174 Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit X-Trace: adenine.netfront.net 1316271301 4814 77.8.37.174 (17 Sep 2011 14:55:01 GMT) X-Complaints-To: news@netfront.net NNTP-Posting-Date: Sat, 17 Sep 2011 14:55:01 +0000 (UTC) User-Agent: MicroPlanet-Gravity/3.0.4 Xref: x330-a1.tempe.blueboxinc.net comp.lang.java.programmer:8105 In article , pats@acm.org says... > Why not just go with radix sort? It seems like a better example of a > practical O(n) sort. > > The proof of the \Omega(n log n) lower bound only applies to comparison > sorts, so there is nothing surprising about the existence of O(n) sorts. Yeah, why not go with radix sort? Whatever algorithm fits. This was the just first one that came to my mind. Kind regards, Wanja -- ..Alesi's problem was that the back of the car was jumping up and down dangerously - and I can assure you from having been teammate to Jean Alesi and knowing what kind of cars that he can pull up with, when Jean Alesi says that a car is dangerous - it is. [Jonathan Palmer] --- Posted via news://freenews.netfront.net/ - Complaints to news@netfront.net ---