Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!feeder.erje.net!eu.feeder.erje.net!fu-berlin.de!uni-berlin.de!individual.net!not-for-mail From: Mike Amling Newsgroups: comp.lang.java.programmer Subject: Re: Help with java insertion sort program Date: Thu, 14 Aug 2014 00:46:47 -0500 Lines: 26 Message-ID: References: Mime-Version: 1.0 Content-Type: text/plain; charset=windows-1252; format=flowed Content-Transfer-Encoding: 7bit X-Trace: individual.net +q/m0nTMCu/jueLdLuj5ggBozj8zezOcYMS5aFAw8Pm+VLivYK Cancel-Lock: sha1:sxr3A90J22p7rSY+y4dkgZWimVE= User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.7; rv:24.0) Gecko/20100101 Thunderbird/24.6.0 In-Reply-To: Xref: csiph.com comp.lang.java.programmer:29661 On 8/10/14 6:43 AM, Eric Sosman wrote: > On 8/10/2014 7:09 AM, Mike Amling wrote: >> On 8/9/14 9:11 PM, Scott Dunning wrote: >>> Hello I trying write a sorting program that will ask a user what type of >>> sorting method to use (insertion, bubble, selection) and then ask them >>> to enter integers to sort. >> >> One wonders why classes are still teaching these algorithms. I've had >> colleagues who have written bubble sort into production code, because >> that's the only algorithm they were ever taught (or maybe it was better >> than some even worse ones). >> >> If you do complete this assignment, throw away the code, look up >> QuickSort, implement a reasonable variation of it, and don't look back. > > Better still, look up Arrays.sort() and Collections.sort() and > throw away your Quicksort implementation. I also have an implementation of the modification to QuickSort that sorts the highest m of n elements into subscripts n-m..n-1 and leaves the lowest n-m elements in subscripts 0..n-m-1 but in no particular order. It's considerably faster than sorting the entire array, which I used to good effect in one game-playing program. --Mike Amling SSdtIGp1c3Qgc2F5aW4nLi4u