Path: csiph.com!usenet.pasdenom.info!aioe.org!eternal-september.org!feeder.eternal-september.org!mx02.eternal-september.org!.POSTED!not-for-mail From: Eric Sosman Newsgroups: comp.lang.java.programmer Subject: Re: best and worst sorting algorithm for 1 to 10,000 and then 10,000 + elements Date: Mon, 04 May 2015 14:27:20 -0400 Organization: A noiseless patient Spider Lines: 12 Message-ID: References: Mime-Version: 1.0 Content-Type: text/plain; charset=windows-1252; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Mon, 4 May 2015 18:26:18 +0000 (UTC) Injection-Info: mx02.eternal-september.org; posting-host="858a9d65d95f4ea4d355bd116aa2cdbf"; logging-data="7054"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX186VNdgMfBPzw+CSPq2LIVr" User-Agent: Mozilla/5.0 (Windows NT 6.1; WOW64; rv:31.0) Gecko/20100101 Thunderbird/31.6.0 In-Reply-To: Cancel-Lock: sha1:9FLeUuzyYal4m+gixiPV6r+SWGg= Xref: csiph.com comp.lang.java.programmer:31650 On 5/4/2015 2:16 PM, Eric Sosman wrote: > On 5/4/2015 1:39 PM, Ajay Paul wrote: >> what are the best and worst sorting algorithm for 1 to 10,000 and then >> 10,000 + elements. > > See Marcel Muller's response. [...] Sorry: Marcel Mueller's response. Ich schäme mich. -- esosman@comcast-dot-net.invalid "Don't be afraid of work. Make work afraid of you." -- TLM