exercise5_15.java

来自「Introduction to java programming 一书中所有编程」· Java 代码 · 共 38 行

// Exercise5_15.java: Insertion sort
public class Exercise5_15 {
  public static void main (String[] args) {
    double[] myList = {5.0, 4.4, 1.9, 2.9, 3.4, 2.9, 3.5};
    System.out.println("My list before sort is: ");

    //prints the original list
    printList(myList);
    insertionSort(myList);

    //prints the sorted list
    System.out.println("My list after sort is: ");
    printList(myList);
  }

  static void printList(double[] list) {
    for (int i = 0; i < list.length; i++)
      System.out.println(list[i]);
  }

  static void insertionSort(double[] list) {
    for (int i = 1; i < list.length; i++) {
      /** The elements in list[0..i-1] are already sorted. To insert
        * the element list[i] into list[0..i-1] is to move list[k] into
        * list[k+1] for k <= i-1 such that list[k] > list[i] */
      double currentElement = list[i];
      int k = i - 1;
      while (k >= 0 && list[k] > currentElement) {
        list[k + 1] = list[k];
        k--;
      }

      // Insert the current element into list[k+1]
      list[k + 1] = currentElement;
    }
  }
}