Consider a modification to merge sort


Very small question regarding the MERGE SORT algorithm

Ques: Consider a modification to merge sort in which n/k sublists of length k are sorted using "insertion sort" and then merged using the standard merging mechanism, where k is a value to be determined.
How should be we choose k in practice?

Request for Solution File

Ask an Expert for Answer!!
Basic Computer Science: Consider a modification to merge sort
Reference No:- TGS0140464

Expected delivery within 24 Hours