Java Program for Insertion Sort
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.
Algorithm of Insertion Sort
The algorithm of Insertion Sort is mentioned below:
- Variable declared i=1
- 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.
- Return the Sorted Array.
Program of Insertion Sort Java
Java
class InsertionSort {
void sort( int arr[])
{
int n = arr.length;
for ( int i = 1 ; i < n; ++i) {
int key = arr[i];
int j = i - 1 ;
while (j >= 0 && arr[j] > key) {
arr[j + 1 ] = arr[j];
j = j - 1 ;
}
arr[j + 1 ] = key;
}
}
static void printArray( int arr[])
{
int n = arr.length;
for ( int i = 0 ; i < n; ++i)
System.out.print(arr[i] + " " );
System.out.println();
}
public static void main(String args[])
{
int arr[] = { 12 , 11 , 13 , 5 , 6 };
InsertionSort ob = new InsertionSort();
ob.sort(arr);
printArray(arr);
}
}
|
The complexity of the above method
Time Complexity: O(N^2)
Auxiliary Space: O(1)
Reference
Please refer complete article on Insertion Sort for more details!
Last Updated :
10 Jan, 2024
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...