Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!feeder.erje.net!1.eu.feeder.erje.net!news2.arglkargh.de!news.swapon.de!fu-berlin.de!uni-berlin.de!individual.net!not-for-mail
From: v_borchert@despammed.com (Volker Borchert)
Newsgroups: comp.lang.java.programmer
Subject: Re: best and worst sorting algorithm for 1 to 10,000 and then 10,000 + elements
Date: 11 May 2015 02:32:30 GMT
Organization: Private site at Eddersheim, Germany
Lines: 11
Distribution: world
Message-ID: <mip4bu$a7t$2@Gaia.teknon.de>
References: <c26476e6-86b7-494b-a2e8-4d9eb7f7bbd7@googlegroups.com>
X-Trace: individual.net NppwlraBj4FXCo70blLejwP8LtU3wMeDr/J61dn6CxuRxwI5un
Cancel-Lock: sha1:xQ+cRqT1fMHIpvvsLF0Yhrop3/E=
Xref: csiph.com comp.lang.java.programmer:31670

Ajay Paul wrote:
> what are the best and worst sorting algorithm for 1 to 10,000 and then 10,000 + elements.
> 
> I understand that bubble short is worst.

Sounds like homework...

-- 

"I'm a doctor, not a mechanic." Dr Leonard McCoy <mccoy@ncc1701.starfleet.fed>
"I'm a mechanic, not a doctor." Volker Borchert  <v_borchert@despammed.com>