In this blog, we will discuss the idea of implementing insertion sort in JAVA with the help of algorithm and code.
In this blog, we will talk about the sorting algorithm: Insertion Sort
Input: An array or sequence of n numbers (a1, a2 … an).
Output: A permutation (reordering) of the given sequence such that they are arranged in ascending order.
The basic idea behind insertion sort is that we assume that the first element is already sorted. Then we compare the rest of the elements with the first element and accordingly place it in its correct position.
for j = 2 to A.length
key = A[j]
// Insert A[j] into the sorted sequence A[1..j-1]
while i>0 and A[i]>key
I = i-1
A[i+1] = key