insertionSort.java

import java.util.Arrays;

public class insertionSort {

  public static void main(String[] args) {
    int[] unsorted = {20, 66, 80, 33, 71, 1, 40, 64, 75, 14};
    
    int[] sorted = insertionSort(unsorted);
  }
  
  public static int[] insertionSort(int[] input) {
    int[] array = input;
    
    for (int i = 0; i < array.length; i++) {
      int current = array[i];
      int pos = i;
      
      while(pos > 0 && array[pos-1] > current) {
        array[pos] = array[pos-1];
        pos--;
      }
      
      array[pos] = current;
    }
    
    return array;
  }

}