Terminus

Algorithms and data structures

Sorting and searching

Merge sort, quicksort, binary search, lower bounds and linear-time sorting.

About 12 hours of study.

Where to learn it

Read
Algorithms, 4th edition (book website)

Robert Sedgewick, Kevin Wayne

Chapter 2

The website and code are free. The printed book is paid.

Section not checked yet

Watch
Introduction to Algorithms (MIT 6.006, Spring 2020)

Erik Demaine, Jason Ku, Justin Solomon

Lectures 3 and 5

Practise
CSES Problem Set

CSES

Sorting and Searching

Section not checked yet

Other options

Wrong chapter, dead link, or know something better? Tell us on GitHub.

Which roles ask for it

Before and after

Sorting and searching