What is insertion sort?
Insertion Sort: One of the easiest sorting algorithms is the insertion sort. Insertion sort having of n - 1 passes. For pass p = 2 by n, insertion sort ensures that the elements in positions 1 by p are in sorted order. Insertion sort makes use of the fact those elements in positions 1 by p - 1 are already called to be in sorted order. To insert a record, we must find the proper place where insertion is to be made