Basics 0/97

Lesson 8 of 8

Sorting and selection

Sort to put a problem in order: custom keys and comparators, event sweeps, coordinate compression, pair counts in merge sort and quickselect.

5,467 words · 25 min read

Difficulty: how hard each problem is if its topic is new to you.

Core 5

Additional practice 5

Further reading 2