Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://www.geeksforgeeks.org/java/java-program-for-insertion-sort/ below:

Java Program for Insertion Sort

Last Updated : 23 Jul, 2025

Insertion sort is a simple sorting algorithm that works the way we sort playing cards in our hands. In this article, we will write the program on Insertion Sort in Java.

Please refer complete article on Insertion Sort for more details! 

The algorithm of Insertion Sort is mentioned below:

1. Variable declared i=1
2. Traverse the Array till i<N
   • If arr[i]<arr[i-1] then arr[j]=value present after shifting the elements of the array from j to i-1.
3. Return the Sorted Array.

Below is the implementation of Insertion Sort in Java:

// Java program for implementation of Insertion Sort

class InsertionSort {
  
    // Function to sort array using insertion sort
    void sort(int a[])
    {
        int n = a.length;
        for (int i = 1; i < n; ++i) {
            int k = a[i];
            int j = i - 1;

            // Move elements of arr[0..i-1], that are
            // greater than key, to one position ahead
            // of their current position
            while (j >= 0 && a[j] > k) {
                a[j + 1] = a[j];
                j = j - 1;
            }
          
            a[j + 1] = k;
        }
    }

    public static void main(String args[])
    {
        int a[] = { 12, 11, 13, 5, 6 };

        InsertionSort ob = new InsertionSort();
        ob.sort(a);

        int n = a.length;
        for (int i = 0; i < n; ++i)
            System.out.print(a[i] + " ");

    }
}

Time Complexity: O(N^2) 
Auxiliary Space: O(1)

Please refer complete article on Insertion Sort for more details!

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4