Stack & Queue
Stack and circular queue pseudocode with overflow/underflow checks and wrap-around logic
Zürich night over Limmat
Stack and circular queue pseudocode with overflow/underflow checks and wrap-around logic
Bucket sort for roughly uniform inputs, with insertion sort per bucket and runtime notes
Radix sort from least-significant digit upward, and why stability is required
Decision trees for comparison sorts, and why comparison sorting needs Ω(n log n)
Stable counting sort in Θ(n+k), with pseudocode and Scala/Python implementations