Skip to content
Toggle sidebar
Pricing
Log in
Sign up free
Loading…
Home
Subjects
Past papers
Key terms
Pricing
My courses
Select your courses
Loading…
Loading…
Merge Sort — AQA GCSE Computer Science 8525
Home
More
Computer Science
AQA GCSE Computer Science
Fundamentals of algorithms
Sorting algorithms
Merge Sort
AQA GCSE Computer Science · 8525
Merge Sort
What you need to know
Describe the step-by-step mechanics of the merge sort algorithm.
Explain how merge sort uses a divide-and-conquer strategy to sort a dataset.
Revision notes
1
Merge Sort
5 key terms
Practise with past papers
Key terms & definitions
Previous topic: Searching algorithms
Linear vs Binary Search
Next subtopic
Bubble Sort
