Insertion sort is a recursive sort which recursively adds a single element to a sorted list thus creating a sorted list of one longer length. An empty array and an array of one element is by default...
the main reason is:
Merge sort is non-adoptive while insertion sort is adoptive
the main reason is:
Merge sort is non-adoptive while insertion sort is adoptive
If there was a way, it would be the new insertion sort! Theoretically you could reduce the time by using a linked list and searching to the position it needs to be inserted and inserting it. In...