Merge Sort
1. What is the complexity of merging two subarrays in the merge sort algorithm? Assume the sizes to be M and N.
2. Which of the following algorithms perform better than merge sort in the worst case time complexity?
3. How does the time complexity of splitting/dividing an array vary with size of the array?
4. What will be the maximum possible array size at the ith level of the merge sort tree for an array of size N (assume level indexing starts from 0, i.e, the original array at the root is said to be at the 0th level)? Fractional results will be rounded up to the nearest integer.