Insertion Sort, Algorithms, Data Structure Algorithm, Coding Interviews, Job Hunting.
Start loop from i = 1 to n-1 Step2: Set key = a[i] Step3: Compare key with all the elements of sorted array using another loop Step4: if the key is smaller than any element of the sorted array shift all the elements of the sorted array Step5: End inner loop Step5: Place key at its correct position