Path: csiph.com!x330-a1.tempe.blueboxinc.net!newsfeed.hal-mli.net!feeder3.hal-mli.net!news.glorb.com!feeder.erje.net!feeder2.ecngs.de!ecngs!feeder.ecngs.de!Xl.tags.giganews.com!border1.nntp.ams.giganews.com!nntp.giganews.com!local2.nntp.ams.giganews.com!nntp.brightview.co.uk!news.brightview.co.uk.POSTED!not-for-mail
NNTP-Posting-Date: Thu, 01 Sep 2011 03:18:31 -0500
Date: Thu, 01 Sep 2011 09:18:31 +0100
From: bugbear <bugbear@trim_papermule.co.uk_trim>
User-Agent: Mozilla/5.0 (X11; U; Linux x86_64; en-US; rv:1.9.1.19) Gecko/20110429 Fedora/2.0.14-1.fc13 SeaMonkey/2.0.14
MIME-Version: 1.0
Newsgroups: comp.lang.java.programmer
Subject: Re: Using Java Classes to Sort a Small Array Quickly
References: <86c4a53b-1ca1-48a8-b954-c01bd449278a@s35g2000prm.googlegroups.com> <j3mupc$d5m$1@dont-email.me>
In-Reply-To: <j3mupc$d5m$1@dont-email.me>
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
Message-ID: <4K-dnfPlx9FFosLTnZ2dnUVZ8n2dnZ2d@brightview.co.uk>
Lines: 14
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-YF7PxIgA35ZA94onTv9YXLHp4XPgB7OcrrHjC+I+mQqSTCGBtRGfwsxNBYCGSHuUhpEHIf/nTiWmvDD!etl7wGxdrdEGj0Oie5G29KUCWZRVNtfcrYamVpOg791u18jtZ6UjEspG6uNjPhwI1S3BqZe0cl8g!R73hQliQCTpAYJGkDRxo2m8yLw==
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly
X-Postfilter: 1.3.40
X-Original-Bytes: 1724
Xref: x330-a1.tempe.blueboxinc.net comp.lang.java.programmer:7513

markspace wrote:
> On 8/31/2011 7:48 PM, KevinSimonson wrote:
>> On the way home from work my fellow carpooler told me that there are
>> Java classes that can do sorts in O(N) time.
>
>
> Pfft. No. Theoretical maximum speed of a sort is something like n log n.
> The only data you can sort in n time is data that's already sorted.

You might want to look up radix sort, which is only applicable
in special (but quite common) cases. Not relevant to the OP,
of course.

  BugBear