Insertion sort algorithm

Insertion sort is an efficient algorithm for sorting a small number of elements, which costs O(n²).

 

 

The operation of INSERTION-SORT on the array A = 〈5, 2, 4, 6, 1, 3〉. Array indices appear above the rectangles, and values stored in the array positions appear within the rectangles. (a)-(e) The iterations of the for loop of lines 1-8. In each iteration, the black rectangle holds the key taken from A[j], which is compared with the values in shaded rectangles to its left in the test of line 5. Shaded arrows show array values moved one position to the right in line 6, and black arrows indicate where the key is moved to in line 8. (f) The final sorted array.

 

 

 

#include <iostream> using namespace std; int main() { int size; //determine the size of the array cout<<"determine the size of array: "; cin>>size; int *array = new int[size]; int i,j,key; cout<<"input numbers: "; //input the numbers that will be sorted for(i=0;i<size;i++) cin>>array[i]; cout<<endl; for(j=1;j<size;j++) //use the insertion sort algorithm to sort the array { key=array[j]; i=j-1; while(i>=0&&array[i]>key) { array[i+1]=array[i]; i--; } array[i+1]=key; } cout<<"sorted array is displayed below: "; //output the sorted array for(i=0;i<size;i++) { cout<<array[i]<<" "; } delete [] array; }