Insertion sort is an algorithm that iterates through an array, comparing each element to its predecessor and swapping the two if out of order, until the entire array is sorted from lowest to highest value. It is more efficient than bubble sort because it requires fewer element comparisons. While slower than quick sort, heap sort, or merge sort for large arrays, insertion sort performs well for small or nearly-sorted data sets due to its simple implementation requiring only O(n) time at best case. Pseudocode and Java code are provided as examples.

1. Introduction
In this example we are going to sort integer values of an array using insertion sort.
Insertion sorting algorithm is similar to bubble sort. But insertion sort is more efficient than bubble sort
because in insertion sort the elements comparisons are less as compare to bubble sort. In insertion
sorting algorithm compare the value until all the prior elements are lesser than compared value is not
found. This mean that the all previous values are lesser than compared value. This algorithm is more
efficient than the bubble sort .Insertion sort is a good choice for small values and for nearly-sorted values.
There are more efficient algorithms such as quick sort, heap sort, or merge sort for large values .
Positive feature of insertion sorting:
1.It is simple to implement
2.It is efficient on (quite) small data values
3.It is efficient on data sets which are already nearly sorted.
The complexity of insertion sorting is O(n) at best case of an already sorted array and O(n2
) at worst
case .
Code description:
In insertion sorting take the element form left assign value into a variable. Then compare the value with
previous values. Put value so that values must be lesser than the previous values. Then assign next
value to a variable and follow the same steps relatively until the comparison not reached to end of array.
Working of insertion sorting:

2. Pseudo kodi
INSERTION-SORT(A)
1 for j ← 2 to length[A]
2 do key ← A[ j ]
3 Insert A[ j ] into the sorted sequence A[1 . . j − 1].
4 i ← j − 1
5 while i > 0 and A[i ] > key
6 do A[i + 1] ← A[i ]
7 i ←i − 1

3. 8 A[i + 1] ← key
The code :
public class InsertionSort{
public static void main(String a[]){
int i;
int array[] = {12,9,4,99,120,1,3,10};
System.out.println(" Insertion sortnn");
System.out.println("Vlerat para rradhitjes:n");
for(i = 0; i < array.length; i++)
System.out.print( array[i]+" ");
System.out.println();
insertion_srt(array, array.length);
System.out.print("Vlerat pas rradhitjes:n");
for(i = 0; i <array.length; i++)
System.out.print(array[i]+" ");
System.out.println();
System.out.println("PAUSE");
}
public static void insertion_srt(int array[], int n){
for (int i = 1; i < n; i++){
int j = i;
int B = array[i];
while ((j > 0) && (array[j-1] > B)){
array[j] = array[j-1];
j--;
}
array[j] = B;
}
}
}
Output :
C:arraysorting>javac InsertionSort.java
C:arraysorting>java InsertionSort
Selection Sort
Vlerat para rradhitjes:
12 9 4 99 120 1 3 10
Vlerat pas rradhitjes:
1 3 4 9 10 12 99 120
PAUSE
C:arraysorting>_