Consider an array of elements arr[5]= {5,4,3,2,1} , what are the steps of insertions done while doing insertion sort in the array.

Consider an array of elements arr[5]= {5,4,3,2,1} , what are the steps

1.	Consider an array of elements arr[5]= {5,4,3,2,1} , what are the steps of insertions done while doing insertion sort in the array.
Answer» hm// Sort an arr[] of size ninsertionSort(arr, n)Loop from i = 1 to n-1.……a) PICK element arr[i] and insert it into sorted sequence arr[0…i-1]code:-// C++ PROGRAM for insertion sort #INCLUDE using NAMESPACE std; /* Function to sort an array using insertion sort/void insertionSort(int arr[], int n) { int i, key, j; for (i = 1; i < n; i++) { key = arr[i]; 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 && arr[j] > key) { arr[j + 1] = arr[j]; j = j - 1; } arr[j + 1] = key; } } // A utility function to print an array of size n void printArray(int arr[], int n) { int i; for (i = 0; i < n; i++) cout << arr[i] << " "; cout << endl; } / Driver code */int main() { int arr[] = { 12, 11, 13, 5, 6 }; int n = sizeof(arr) / sizeof(arr[0]); insertionSort(arr, n); printArray(arr, n); return 0; }