This is a collection of implementations for 75 fundamental algorithms problems, including data structures, numerical and combinatorial algorithms,graph algorithms, and computational geometry. Implementations are available in C++, Java, Fortran, and other languages.
Course material, syllabus and notes for a course by Roger Whitney at SDSU.
Searchable index of problems, links and methodology.
An evolving web text in PostScript and PDF, with related software.
A collection of source code for various topics.
Links to courses in algorithms maintained at various university computer science departments.
Information on algorithms such as Bubble Sort and Random Number Generation, using HTML, Java and Perl. Collected by Lam Ka Chun (Raymond).
An initiative of attendees of the 1997 Dagstuhl seminar, these pages provide research papers, a bulletin board, and links to researchers and other resources in the field. The focus is on average case and probabilistic analysis.
Lecture notes and links for a course by Godfried Toussaint.
A list of open problems with updates and solutions.