Searching and sorting
Kent Quanrud · 100:57
This opening graduate-algorithms lecture argues that the course is about distinguishing unstructured combinatorial explosion (\(2^n\)) from structured logarithmic search (\(\log n\)), then uses sorting to introduce Bi...