Sorting

Putting items in order - how a simple method like selection sort works and why it is slow, and how to use Python's fast, stable sort with keys, including sorting by several things at once.

Depth 1 · Foundation

You can carry out selection sort pass by pass and say why it is O(n²), use sorted and list.sort with key and reverse, explain what a stable sort keeps, and sort by two keys with a tuple key or two sorts.

Depths of understanding

1
Foundation
You can carry out selection sort pass by pass and say why it is O(n²), use sorted and list.sort with key and reverse, explain what a stable sort keeps, and sort by two keys with a tuple key or two sorts.
Opens after
Algorithm efficiencyThe point of comparing sorting methods is how their work grows, so you need that first.First-class functionsSorting by anything but the items themselves means handing sorted a key function.

Your path here

What's still between you and Sorting, depth 1, in the order you can learn it.

Where it fits

Builds on

Algorithm efficiency First-class functionsFunctions

This concept

SortingAlgorithms

Builds onThis conceptAlgorithm efficiency First-class functionsFunctions SortingAlgorithms