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?