Path: csiph.com!x330-a1.tempe.blueboxinc.net!usenet.pasdenom.info!aioe.org!eternal-september.org!feeder.eternal-september.org!.POSTED!not-for-mail From: Eric Sosman Newsgroups: comp.lang.java.programmer Subject: Re: Using Java Classes to Sort a Small Array Quickly Date: Thu, 01 Sep 2011 00:54:14 -0400 Organization: A noiseless patient Spider Lines: 14 Message-ID: References: <86c4a53b-1ca1-48a8-b954-c01bd449278a@s35g2000prm.googlegroups.com> Mime-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit Injection-Date: Thu, 1 Sep 2011 04:55:06 +0000 (UTC) Injection-Info: mx04.eternal-september.org; posting-host="f8igmItKsWs6nM5YanFxAA"; logging-data="1314"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+NVTL+yd2inR1sPl9WjnQQ" User-Agent: Mozilla/5.0 (Windows NT 5.1; rv:6.0) Gecko/20110812 Thunderbird/6.0 In-Reply-To: Cancel-Lock: sha1:9KEZ5CD6E0y57ejpz/EVCQCoY0U= Xref: x330-a1.tempe.blueboxinc.net comp.lang.java.programmer:7509 On 9/1/2011 12:25 AM, Eric Sosman wrote: >[...] If Arrays.sort takes a microsecond while > yours takes 100 nanoseconds, and if all your investigation and > implementation (and writing to Usenet) took just ten minutes, you > need more than six hundred billion fast sorts merely to break even. "For suitable values of a billion," like those that begin with an "M" instead of a "B." -- Eric Sosman esosman@ieee-dot-org.invalid