Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.java.programmer > #31649
| Path | csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!feeder.erje.net!1.eu.feeder.erje.net!news.swapon.de!eternal-september.org!feeder.eternal-september.org!mx02.eternal-september.org!.POSTED!not-for-mail |
|---|---|
| From | Eric Sosman <esosman@comcast-dot-net.invalid> |
| 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:16:40 -0400 |
| Organization | A noiseless patient Spider |
| Lines | 24 |
| Message-ID | <mi8d0a$4of$1@dont-email.me> (permalink) |
| References | <c26476e6-86b7-494b-a2e8-4d9eb7f7bbd7@googlegroups.com> |
| Mime-Version | 1.0 |
| Content-Type | text/plain; charset=windows-1252; format=flowed |
| Content-Transfer-Encoding | 7bit |
| Injection-Date | Mon, 4 May 2015 18:15:38 +0000 (UTC) |
| Injection-Info | mx02.eternal-september.org; posting-host="858a9d65d95f4ea4d355bd116aa2cdbf"; logging-data="4879"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX18RK5c3ikj+JR/9menThyuC" |
| User-Agent | Mozilla/5.0 (Windows NT 6.1; WOW64; rv:31.0) Gecko/20100101 Thunderbird/31.6.0 |
| In-Reply-To | <c26476e6-86b7-494b-a2e8-4d9eb7f7bbd7@googlegroups.com> |
| Cancel-Lock | sha1:ICKMgLMAkwUOkRub8tNihml9EO0= |
| Xref | csiph.com comp.lang.java.programmer:31649 |
Show key headers only | View raw
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. As a practical matter, use
java.util.Collections#sort or java.util.Arrays#sort and apply
your ingenuity to the other problems your program needs to solve.
Later on, if you measure the performance, find it inadequate,
discover that sorting is a significant time-waster, *and* think
you can do better -- if all those, then and only then implement
your own sort.
> I understand that bubble short is worst.
Not even close. One well-known far worse sort is
https://en.wikipedia.org/wiki/Bogosort
... and of course any implementation of any algorithm can always
be disimproved. (One effective way is to post the bad code to
Usenet and solicit improvements ;)
--
esosman@comcast-dot-net.invalid
"Don't be afraid of work. Make work afraid of you." -- TLM
Back to comp.lang.java.programmer | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
best and worst sorting algorithm for 1 to 10,000 and then 10,000 + elements Ajay Paul <ajaykpaul@gmail.com> - 2015-05-04 10:39 -0700
Re: best and worst sorting algorithm for 1 to 10,000 and then 10,000 + elements Marcel Mueller <news.5.maazl@spamgourmet.org> - 2015-05-04 19:54 +0200
Re: best and worst sorting algorithm for 1 to 10,000 and then 10,000 + elements Eric Sosman <esosman@comcast-dot-net.invalid> - 2015-05-09 07:58 -0400
Re: best and worst sorting algorithm for 1 to 10,000 and then 10,000 + elements Eric Sosman <esosman@comcast-dot-net.invalid> - 2015-05-04 14:16 -0400
Re: best and worst sorting algorithm for 1 to 10,000 and then 10,000 + elements Eric Sosman <esosman@comcast-dot-net.invalid> - 2015-05-04 14:27 -0400
Re: best and worst sorting algorithm for 1 to 10,000 and then 10,000 + elements Martin Gregorie <martin@address-in-sig.invalid> - 2015-05-08 20:42 +0000
Re: best and worst sorting algorithm for 1 to 10,000 and then 10,000 + elements v_borchert@despammed.com (Volker Borchert) - 2015-05-11 02:32 +0000
Re: best and worst sorting algorithm for 1 to 10,000 and then 10,000 + elements Gene Wirchenko <genew@telus.net> - 2015-05-11 14:00 -0700
Re: best and worst sorting algorithm for 1 to 10,000 and then 10,000 + elements Eric Sosman <esosman@comcast-dot-net.invalid> - 2015-05-11 17:27 -0400
Re: best and worst sorting algorithm for 1 to 10,000 and then 10,000 + elements Arne Vajhøj <arne@vajhoej.dk> - 2015-06-03 21:53 -0400
csiph-web