Implementing Insertion Sort Algorithm in Java Program

Human-Written Content: This article was demonstrated by a human, not AI.

Please support independent contributors like Code2care by donating a coffee.

Insertion sort is a simple sorting algorithm in which we insert the elements from an unsorted array into a sorted subarray until the entire array is sorted. It's also called a in-place algorithm as it only requires a constant amount of additional memory.

To implement Insertion sort in Java, you can use a for loop to iterate over the unsorted array and an inner while loop to insert the current element into the correct position in the sorted subarray.

package org.code2care.java.sorting.algo;

import java.util.Arrays;

public class InsertionSortJavaExample {

    public static void main(String[] args) {

        //Unsorted Array
        int[] unsortedArray = {4, 99, 2, 11, 34, 67, 54, 12, 45, 245, 234, 12, 200};
        InsertionSortJavaExample insertionSort = new InsertionSortJavaExample();

        int[] sortedArray = insertionSort.insertionSortAlgorithm(unsortedArray);

        System.out.println(Arrays.toString(sortedArray));
    }

    public int[] insertionSortAlgorithm(int[] arrayOfNumbers) {

        int arrayLength = arrayOfNumbers.length;

        for (int i = 1; i < arrayLength; i++) {
            int key = arrayOfNumbers[i];
            int j = i - 1;
            while (j >= 0 && arrayOfNumbers[j] > key) {
                arrayOfNumbers[j + 1] = arrayOfNumbers[j];
                j--;
            }
            arrayOfNumbers[j + 1] = key;
        }

        return arrayOfNumbers;
    }
}

Output: