Merge Sort
Lesson notes
Overview
Split in half, sort each half, merge. Divide and conquer guarantees O(n log n). This topic is rated beginner and is number 4 of 117 in Computer Science. Core ideas and first intuitions. No prior knowledge needed.
What you are seeing
The panel above shows an algorithm working step by step on a list, with comparisons and swaps highlighted. The animation is drawn live from the model, so everything you see responds to the sliders. Press Space to pause, use Restart to replay from the start, and change the speed to slow down quick events.
In depth
Merge sort is a divide-and-conquer algorithm: split the list in half, sort each half recursively, then merge the two sorted halves by repeatedly taking the smaller front item. The list is halved log n times and each level of merging costs n steps, so the total is O(n log n) in every case. It is stable and good for linked lists and external data, but needs O(n) extra memory for arrays.
The key idea, step by step
1. Split in half, sort each half, merge. 2. Divide and conquer guarantees O(n log n).
Reading the relationship
The expression "O(n log n)" is a compact summary of the idea. It uses the symbols O, n; name what each one stands for before you start. Notice that it contains a logarithm, which turns multiplication into addition and compresses large values. Then use the sliders to see how changing one quantity changes the others.
A guided exploration
1. Run the algorithm on the default list and count the comparisons. 2. Change the list size and see how the work grows. 3. Compare the result with another sorting method on the same input.
Try this
Start by only moving one slider at a time. Say aloud what you expect, then check.
Common pitfalls
Test small inputs by hand and then the largest ones. Off-by-one errors and forgetting how cost grows with input size are the most common traps.
How it connects
It builds on “Insertion Sort”, the topic before it in Computer Science. Once you are comfortable, continue with “Quicksort”.
Why it matters
Computing ideas decide how fast, how safely and how well software can solve problems.
Where you might use it
- Revising “Merge Sort” before a class, exam or certification
- Choosing the right algorithm or data structure when writing software or apps
- Debugging programs and judging how fast or how safely code will run at scale
- Understanding how search engines, games, phones and AI systems make decisions
Frequently asked questions
What is Merge Sort?
Split in half, sort each half, merge. Divide and conquer guarantees O(n log n). It is a beginner topic in Computer Science.
How do I use the Merge Sort simulation?
The panel at the top shows an algorithm working step by step on a list, with comparisons and swaps highlighted. Move the sliders one at a time, then press Space to pause the animation and look closer.
What does the formula mean?
The expression O(n log n) packs the idea into symbols. Name each symbol first, then change one quantity with the sliders and see which others respond.
Who is this topic for?
Core ideas and first intuitions. No prior knowledge needed. If the quiz feels hard, reread the lesson notes and try the previous topic first.
What should I learn before this?
Start with “Insertion Sort”, the previous topic in Computer Science. Each topic in a subject builds on the ones before it.
How do I track my progress?
Press “Mark as learned” on this page. Progress is stored only in this browser and is never sent anywhere. The Browse page can show topics you have learned or still need to learn.