Question

Insertion sort for 12, 2, 3, 21, 11, 10,8 java lanuage

Answer 1

Java Code for Insertion Sort:

public class Main {
public static void insertionSort(int array[]) {
int n = array.length;
for (int j = 1; j < n; j++) {
int key = array[j];
int i = j-1;
while ( (i > -1) && ( array [i] > key ) ) {
array [i+1] = array [i];
i--;
}
array[i+1] = key;
}
}

public static void main(String a[]){
int[] arr1 = {12, 2, 3, 21, 11, 10,8};
System.out.println("Before Insertion Sort");
for(int i:arr1){
System.out.print(i+" ");
}
System.out.println();
  
insertionSort(arr1);//sorting array using insertion sort

System.out.println("After Insertion Sort");
for(int i:arr1){
System.out.print(i+" ");
}
}
}

Output Screen:

This code has ben compiled with online java compiler.