Quadratic vs n log n Sorting
Lesson notes
Overview
For large n an n log n algorithm decisively beats n². This topic is rated beginner and is number 82 of 117 in Computer Science. Core ideas and first intuitions. No prior knowledge needed.
What you are seeing
The panel above shows a graph of the function. Each slider changes one parameter, so you can see exactly how the curve bends, shifts or stretches. 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
For 1,000 items, an O(n²) sort needs about a million comparisons while an O(n log n) sort needs only about 10,000, a hundredfold difference. For a million items, it is 10¹² against 2 × 10⁷, which is the difference between days and a fraction of a second. So for large data sets, merge sort, heap sort and quicksort are used, while simple quadratic methods are only suitable for small inputs.
Reading the relationship
The expression "n² vs n log n" is a compact summary of the idea. It uses the symbols n, v, s; name what each one stands for before you start. Notice that it contains a squared term, so doubling that quantity changes the result by a factor of four, and 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. Set every slider to its middle value and note the shape of the curve. 2. Move one slider at a time and describe whether the curve shifts, stretches or turns. 3. Find the value where the behaviour changes sharply, then connect it to the formula.
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 “Time Complexity: Linear vs Logarithmic”, the topic before it in Computer Science. Once you are comfortable, continue with “Exponential Time Explosion”.
Why it matters
Computing ideas decide how fast, how safely and how well software can solve problems.
Where you might use it
- Revising “Quadratic vs n log n Sorting” 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 Quadratic vs n log n Sorting?
For large n an n log n algorithm decisively beats n². It is a beginner topic in Computer Science.
How do I use the Quadratic vs n log n Sorting simulation?
The panel at the top shows a graph of the function. Each slider changes one parameter, so you can see exactly how the curve bends, shifts or stretches. Move the sliders one at a time, then press Space to pause the animation and look closer.
What does the formula mean?
The expression n² vs 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 “Time Complexity: Linear vs Logarithmic”, 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.