← 🧩 Algorithms Foundations24 / 25
Lesson 24 — Merge sort
Stable divide and conquer
Split in half, sort each, then merge — guaranteed O(n log n).
Why it matters: it is stable and predictable, used in libraries.
Task
Sort the list with merge sort.
Keep going with Algorithms Foundations
Ready for more? These paid resources pick up where this lesson leaves off.
UdemyBestsellers
Top-rated Algorithms Foundations courses
Project-based Algorithms Foundations video courses — the perfect paid next step after these free lessons.
Browse on Udemy →AmazonReader picks
Best Algorithms Foundations books
Hand-picked Algorithms Foundations books to master the fundamentals offline.
See on Amazon →Some links on this page are affiliate links: we may earn a commission at no extra cost to you. We only recommend tools we believe are genuinely useful.