Sorting algorithms

EasyMediumHard
12345678910111213141516171819202122232425262728293031323334353637
Question 3
Medium

A list of 8 student test scores is to be sorted into ascending order using a merge sort algorithm.

Figure 1 shows a partially completed tree diagram representing this sorting process.

Merge Sort Tree Diagram

a.

State the contents of the blank boxes labeled A, B, C, and D.

[2]
b.

Explain how the merge sort algorithm operates, with reference to the "divide" (rows 1–4) and "merge" (rows 4–7) phases of the process shown in Figure 1.

[2]

Sorting algorithms Questions

  1. GCSE
  2. /Computer Science
  3. /Sorting algorithms