what is the different between merge sort and insertion sort
Merge sort ought to routinely beat insertion sort in terms of processing time if you tried sorting a sizable,random array with both methods.However,because insertion sort has less overhead,it might be faster if the array were tiny or almost sorted.
New contributor
Chanuki Ranasinghe is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
1