Sorting lower bounds with a decision tree
Derive the comparison-sorting lower bound from permutation leaves, inspect the three-item case, and state why counting and radix sorting use a different model.
Foundation
The journal / Ideas in progress
Engineering & everyday learningNotes from
the work.
Software, systems, and the things I’m learning along the way. From first principles to AI in production.
Find something to readAll notes 1
A little theory. A lot of practice.