Question: you have an algorithm mergesort3 that breaks a list into...
You have an algorithm MergeSort3 that breaks a list into three parts, performs merge sort on them, and then merges them. This run time is O(nlogn), which makes sense to me, what doesn't make sense is why the MergeSort_k below would be problematic and not fit this mold. The actual question I need answered is at the bottom, a thorough laymen's terms explanation would be appreciated
Below is the description of a problematic MergeSort_k that your friend has thought of in light of the basic properties of MergeSort3. Why is this problematic?