Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time.
So in beginning we compare the first two elements and sort them by comparing them.
Then we pick the third element and find its proper position among the previous two sorted elements.
This way we gradually go on adding more elements to the already sorted list by putting them in their proper position.
Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. So in beginning we compare the first two elements and sort them by comparing them. Then we pick the third element and find its proper position among the previous two sorted elements. This way we gradually go on adding more elements to the already sorted list by putting them in their proper position.
Thanks for review this code