Algorithms / Arrays / Insertion Sort

algorithms-arrays-insertionSort.java

package org.joeltong.test;


import java.util.Arrays;

public class App {

    public static void main(String[] args) {
        int[] arr = new int[]{5,3,89,4,4,45,22,44,5,3};
        insertionSort(arr);
        System.out.println(Arrays.toString(arr));
    }


    static void insertionSort(int[] arr) {
        for (int i = 1; i < arr.length; i++) {
            int j = i;
            while(j > 0 && arr[j-1] > arr[j]) {
                swap(arr, j-1, j);
                j--;
            }
        }
    }


    static void swap(int[] arr, int i, int j) {
      int temp = arr[i];
      arr[i] = arr[j];
      arr[j] = temp;
    }
}