Lecture 03: Sorting Algorithms Continued

Content locked

The catalog is public. Reading this content requires approved access.

Upper bounds, lower bounds, and the model

The sorting decision tree

The lower-bound proof

What the lower bound does and does not say

In-class exercises, with recorded solutions

Counting sort

Radix sort

Algorithm and example

Correctness

Running time and choosing the base

Accessing digits

VLSI layout as divide and conquer

Conventional tree layout

H-tree embedding

Connections

Instructor solutions