Skip to content

Course home

Algorithms

Algorithms

EasyMedium
123456789101112131415161718
Question 7

A list of tree species needs to be sorted into descending alphabetical order using a merge sort algorithm.

Here are the five sublists created at the end of the initial splitting process:

[Rowan]     [Birch]     [Willow]     [Oak]     [Maple]

It will require three passes to merge these sublists back into a single sorted list in descending alphabetical order.

Complete the three merge passes by filling in the missing sublists.

  • Pass 1: [ Rowan, Birch ], [ Willow, Oak ], [ Maple ]

  • Pass 2: [ __________________________________ ], [ Maple ]

  • Pass 3: [ __________________________________________ ]

[2]
Markscheme

Algorithms Questions

  1. IGCSE
  2. /Computer Science
  3. /Algorithms

45 exam-style questions on Edexcel IGCSE Computer Science Algorithms. Each one has a worked solution and a mark scheme showing where the marks go.

Question bank