C++ & Java implementations of 6 algorithm problems — tromino tiling, knight's tour, Tower of Hanoi (4-peg), knight swap, target shooting, and lattice coverage — using Divide & Conquer, Greedy, BFS, ...

Weiss, Data Structures and Algorithm Analysis in Java, Chapters 2-5, 6-6.4, 6.9, 7, 9-9.3, 9.5; class lecture notes; MapReduce paper.

remove-circle Internet Archive's in-browser video "theater" requires JavaScript to be enabled. It appears your browser does not have it turned on. Please see your ...

Sorting algorithms are an essential chapter in undergraduate computer science education. Due to their easy to explain nature and fairly straight-forward analysis, this set of algorithms offers a ...