If we divide the array into two or three or four different parts not same like 2/3 or 3/4 etc then what is complexity regarding to merge sort?
Suppose we do merge sort with a three-way split: divide the array into 3 equal parts, sort each part and do a 3 way merge. What would the worst-case complexity of this version be?