Divide and Conquer

The median of n elements can be found in O(nlogn) time. What is the time complexity of the quick sort in which the median is selected as a pivot?

Which one of the following is a possible intermediate result of merge sort after merging all the sorted lists of size 2?

Consider we have '' sorted subarrays each of size . Then the time complexity to find a single sorted array with all elements is?

A modified version of merge sort is devised with a modified merge method is used where the merge takes O(n²) time to merge lists that sum up to size n, the time complexity for such a version of merge sort is _______.

Let us suppose we have 4 sorted lists of 8 elements each. They are merged into a single sorted list of 32 elements. The key comparisons that are needed in the worst case using an efficient algorithm are ___.