Topic 10 C: Proof of O(n lg n) bound on comparison sorts, and examination of three O(n) sort algorithms that don't do (as many) comparisons. 400x300 version. Also the conclusion of my "quick" hike to Paliku cabin in which I attempted to return in O(n) time.
Lecture by Dan Suthers for University of Hawaii Information and Computer Sciences course 311 on Algorithms. (Inverted course: lectures are online and problem solving in class.)
Based on Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Introduction to Algorithms, Third Edition, The MIT Press, 2009.
