Algorithms for Beginners / Chapter 3 — Sorting (lessons 6–9) / Lesson 8

Sorting 3: quicksort and the worst case

🔒

Create a free account to read this lesson

Sign up for a free membership to read every lesson in our free courses. Already have an account? Please sign in.

Sign up free Sign in

‹ Previous: Sorting 2: merge sort and divide and conquer Next: The built-in sort and key (Timsort is 42x faster) ›