Sorting Algorithm Flowchart

Part of Merge Sort · Section 3 of 8

DiagramUnit: 3.1 Fundamentals of AlgorithmsGCSE

This diagram covers Sorting Algorithm Flowchart within Merge Sort for GCSE Computer Science. Revise Merge Sort in 3.1 Fundamentals of Algorithms for GCSE Computer Science with 16 exam-style questions and 10 flashcards. This topic appears less often, but it can still be a useful differentiator on mixed-topic papers. It is section 3 of 8 in this topic. Focus on the labels, the relationships between parts, and the explanation that turns the diagram into an exam-ready answer.

Sorting Algorithm Flowchart

Sorting algorithm flowchart showing the step-by-step decision process for bubble sort: start, set pass count to zero, compare first pair of adjacent elements, decision diamond asking if left greater than right, if yes swap them, move to next pair, if end of list check if any swaps made this pass, if yes repeat from start, if no the list is sorted

Practice questions for Merge Sort

Which design strategy does merge sort use?

  • A. Brute force — try every possible ordering
  • B. Greedy — always pick the locally best element
  • C. Divide and conquer — split the list, sort halves, then merge
  • D. Dynamic programming — store results to avoid repeated work
1 markfoundation

Describe how merge sort works. You should include what happens in both the divide and merge phases.

3 marksstandard

Quick recall flashcards

What technique does merge sort use?
Divide and conquer - splits list in half repeatedly then merges sorted halves
Is merge sort a recursive algorithm?
Yes - it calls itself on smaller sub-lists

Previous

Digital Dice

Next

Random Number Functions

16 questions on Merge Sort — practise free

Instant marking, adaptive difficulty and spaced-repetition flashcards — all aligned to your exam board.

Start revising free →