Moret and Shapiro's Algorithms P to NP
This algorithms text 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,
fundamental graph and geometric algorithms.
The programs in the book have been made available by anonymous ftp
from cs.unm.edu in directory /pub/moret_shapiro.
Download Files (local site)Source ftpBernard Moret's Webpage
Problem Links
This page last modified on 2008-07-10
.
www.algorist.com
