You have an algorithm MergeSort3 that breaks a list into threeparts, performs merge sort on them, and then merges them. This runtime is O(nlogn), which makes sense to me, what doesn’t make senseis why the MergeSort_k below would be problematic and not fit thismold. The actual question I need answered is at the bottom, athorough laymen’s terms explanation would be appreciated
Below is the description of a problematic MergeSort_k that yourfriend has thought of in light of the basic properties ofMergeSort3. Why is this problematic?
PayPal Gateway not configured
PayPal Gateway not configured