insertion sort java code code example

Example 1: java insertion sort

/**
* Insertion sort algorithm, O(n^2) time complexity.
*/
public static void insertionSort(int[] arr) {
  int n = arr.length;
  for(int i = 1; i < n; i++) {
    int key = arr[i];
    int j = i - 1;
    //shift until you find the position to place the element 'key'
    while(j >= 0 && arr[j] > key) {
      arr[j+1] = arr[j];
      j--;
    }
    //place element 'key' in the correct position in the sorted part of the array
    arr[j+1] = key;
  }
}

Example 2: insertion sort java

Insertion program
public class InsertionSortExample
{
   public void sort(int[] arrNum)
   {
      int number = arrNum.length;
      for(int a = 1; a < number; ++a)
      {
         int keyValue = arrNum[a];
         int b = a - 1;
         while(b >= 0 && arrNum[b] > keyValue)
         {
            arrNum[b + 1] = arrNum[b];
            b = b - 1;
         }
         arrNum[b + 1] = keyValue;
      }
   }
   static void displayArray(int[] arrNum)
   {
      int num = arrNum.length;
      for(int a = 0; a < num; ++a)
      {
         System.out.print(arrNum[a] + " ");
      }
      System.out.println();
   }
   public static void main(String[] args)
   {
      int[] arrInput = { 50, 80, 10, 30, 90, 60 };
      InsertionSortExample obj = new InsertionSortExample();
      obj.sort(arrInput);
      displayArray(arrInput);
   }
}

Example 3: Insertion sort string array java

// Insertion sort string array java
public class InsertionSortString
{
   public static void main(String[] args)
   {
      String[] arrFruits = {"Orange","Mango","Apple","Pineapple","Banana"};
      String[] strSorted = sortStringArray(arrFruits, arrFruits.length);
      for(int a = 0; a < strSorted.length; a++)
      {
         System.out.println(strSorted[a]);
      }
   }
   public static String[] sortStringArray(String[] strArray, int g)
   {
      String temp = "";
      for(int a = 0; a < g; a++)
      {
         for(int b = a + 1; b < g; b++)
         {
            if(strArray[a].compareToIgnoreCase(strArray[b]) > 0)
            {
               temp = strArray[a];
               strArray[a] = strArray[b];
               strArray[b] = temp;
            }
         }
      }
      return strArray;
   }
}