here’s the term i wrote
:insertion sorting is comparison based algorithm in which there are 2 sub list . 1 is sorted and another is unsorted
the sorted sub list contains the first element of the array i.e (0). and unsorted list contains every element except element in sorted
sub-list . this algorithm compares all element in unsorted sub list with elements in sorted sub-list ,. if the element in unsorted sub-list
is greater than the element in sorted list then it shifts all the element in sorted sub list that is greater than the value to be sorted
and it inserts the value at the correct location . it stops comparing all the values when all elements in array
