Path: csiph.com!usenet.pasdenom.info!gegeweb.org!eternal-september.org!feeder.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: Jeff Higgins <jeff@invalid.invalid>
Newsgroups: comp.lang.java.programmer
Subject: Re: Help with java insertion sort program
Date: Sat, 09 Aug 2014 22:28:06 -0400
Organization: A noiseless patient Spider
Lines: 106
Message-ID: <ls6lcd$5nm$1@dont-email.me>
References: <ls6k6e$v0r$1@dont-email.me>
Mime-Version: 1.0
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Sun, 10 Aug 2014 02:28:29 +0000 (UTC)
Injection-Info: mx05.eternal-september.org; posting-host="b896cb427f8c4d19d14880347aa9d6ce"; logging-data="5878"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1+vH2hbQ1JNShZjIaVna0ixEc74yrCG08Q="
User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:24.0) Gecko/20100101 Icedove/24.7.0
In-Reply-To: <ls6k6e$v0r$1@dont-email.me>
Cancel-Lock: sha1:XtnKZaHhQgugbwWb7gs8iHknMdU=
Xref: csiph.com comp.lang.java.programmer:29608

On 08/09/2014 10: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.

I guessing that since you are asking for help here that working
the problem out from first principles on your own is not a requirement.

I'll suggest then that Google is your friend.
Algorithms 4th ed. Sedgewick Wayne
2.1   Elementary Sorts
<http://algs4.cs.princeton.edu/21elementary/>


> I thought I had everything correct but apparantly not.  Haha.  This is
> the output and I am not sure where I am going wrong.
>
> Before Sorting:
> [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
>
> After Sorting:
> [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
> [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
>
>
> Do I seem to be putting things in the correct spot?
>
> Thanks for any help!!
>
> DriverSort class...
>
>      import java.util.Scanner;
>
>      public class DriverSort {
>
>      public static void main(String[] args) {
>
>          Scanner scan =new Scanner(System.in);
>          Sorter sorter = new Sorter();
>
>          int choice;  // variable which says which sorting algorithm to use
>
>          System.out.println("1-Insertion sort\n"
>                          +"2-Selection sort\n"
>                          + "3-Bubble sort\n"
>                          + "0-quit\n");
>          choice = scan.nextInt();
>
>          System.out.println("Please enter the number for a sorting
> method or enter 0 to quit: ");
>          int size = scan.nextInt();
>          int input[] = new int[size];
>
>
>          System.out.println("\nBefore Sorting: ");
>          sorter.printArray(input);
>              // sort the array
>              Sorter.insertionSort(input);
>              System.out.println("\nAfter Sorting: ");
>              sorter.printArray(input);
>
>          switch (choice) {
>
>          case 0:
>              System.out.println("Goodbye!");
>              System.exit(0);
>              break;
>
>          case 1: Sorter.insertionSort(input);
>              sorter.printArray(input);
>              break;
>
>          }
>        }
>     }
>
> Sorter class....
>
>
>      public class Sorter {
>
>      public static int[] insertionSort(int[] input) {
>
>          for (int i = 1; i < input.length; i++) {
>              int valueToSort = input[i];
>              int j = i;
>              while (j > 0 && input[j - 1] > valueToSort) {
>                  input[j] = input[j - 1];
>                  j--;
>              }//end while loop.
>              // insert the element
>              input[j] = valueToSort;
>          }//end for loop
>              return input;
>      }//end insertionSort
>
>
>          public void printArray(int[] input) {
>              System.out.println(Arrays.toString(input));
>
>          }
>      }
>
>
>