Algorithms and Data Structures

Programs are comprised of data structures and algorithms. Every programmer should know the basics, but not even the greatest programmers know them all. Being able to research existing algorithms and data structures can aid developers in determining the most efficient way of solving their problems. In addition to NIST's dictionary, I would highly recommend any serious programmer to read the venerable Donald Knuth's magnum opus, The Art of Computer Programming.

NIST's Dictionary of Algorithms and Data Structures contains a listing of many data structures, algorithms, and terminology related to those concepts. Each entry includes a definition, relevant information (such as time and memory complexity), and implementation examples in various languages. Some items also include external links to tutorials and further analysis.

Tips for use:

• All of the entries are arranged alphabetically on the main page. The fastest way to navigate on any individual entry is to use the browser's search tool.
• There entries are also indexed in a set of alphabetically listed pages, by type, and by topic. The type and topic pages will be more useful to conduct general research.
• More related information is linked to on each entry's page. For example, the Monte Carlo algorithm page links to the definition of a randomized algorithm, the Las Vegas algorithm, RP (Randomized Polynomial time), and the &rho approximation algorithm.