This algorithms text [MS91] distinguishes itself by including Pascal implementations of many algorithms, with careful experimental comparisons of different algorithms for such problems as sorting and minimum spanning tree, and heuristics for the traveling salesman problem. It provides a useful model for how to properly do empirical algorithm analysis.
The programs themselves are probably best used as models. Interesting implementations include the eight-queens problem, plus fundamental graph and geometric algorithms. The programs in [MS91] have been made available by anonymous ftp from cs.unm.edu in directory /pub/moret_shapiro.