Merge Sort

Choose difficulty:

Beginner

Intermediate

Advanced

1. Consider the array: A = [9, 100, -1, 4, 8, 6, 9]. How many rounds of splitting (dividing) and how many total split operations are needed to break the array down for merge sort? (A round means all splits at the same level; a split operation means each time an array is divided.)

a: 2 rounds, 6 splits Explanation

Explanation

b: 3 rounds, 6 splits Explanation

Explanation

c: 6 rounds, 2 splits Explanation

Explanation

d: 6 splits, 3 rounds Explanation

Explanation

2. During which step of merge sort does the actual sorting happen?

a: Splitting (division) Explanation

Explanation

b: A separate sorting step Explanation

Explanation

c: Merging Explanation

Explanation

d: None of the above Explanation

Explanation

3. Which of the following best describes how the merge step works in merge sort (for ascending order)?

a: We just join the subarrays one after the other. Explanation

Explanation

b: We compare the first elements of each subarray, add the smaller one to the result, and repeat until all elements are merged. Explanation

Explanation

c: We alternate picking elements from each subarray regardless of value. Explanation

Explanation

d: None of the above. Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

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