Merge Sort

Choose difficulty:

Beginner

Intermediate

Advanced

1. What is the complexity of merging two subarrays in the merge sort algorithm? Assume the sizes to be M and N.

a: O(M + N) Explanation

Explanation

b: O(M * N) Explanation

Explanation

c: O(M * N^2) Explanation

Explanation

d: O((M * N) ^ 2) Explanation

Explanation

2. Which of the following algorithms perform better than merge sort in the worst case time complexity?

a: Heap Sort Explanation

Explanation

b: Quick Sort Explanation

Explanation

c: Both a and b Explanation

Explanation

d: None of the above Explanation

Explanation

3. How does the time complexity of splitting/dividing an array vary with size of the array?

a: No change, i.e, the complexity does not depend on the array size Explanation

Explanation

b: Directly proportional, i.e, complexity increases as array size increases Explanation

Explanation

c: Inversely proportional, i.e, complexity decreases as array size increases Explanation

Explanation

d: None of the above Explanation

Explanation

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.

a: 2^i * N Explanation

Explanation

b: i * N Explanation

Explanation

c: N / i Explanation

Explanation

d: N / 2^i Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)