Dictionary of Algorithms and Data Structures (xlinux.nist.gov)

Article summary

The Dictionary of Algorithms and Data Structures is a website hosted by NIST that provides a comprehensive collection of algorithms, data structures, and related definitions. The site was started in 1998 and is edited by Paul E. Black. It includes a wide range of topics, from common functions like Ackermann's function to more complex problems like the traveling salesman problem. The site also provides links to implementations and more information on various topics.

Main themes

• algorithms and data structures
• education and learning
• resource evaluation
• applications and context
• comprehensiveness and limitations
• interactive learning tools

What commenters say

• The Dictionary of Algorithms and Data Structures is a valuable resource for learning and reference, but may not be the best starting point for beginners.
• Some commenters feel that data structures and algorithms courses should focus more on applications and context rather than just definitions.
• The site is missing some important topics, such as Fenwick trees and union-find algorithms.
• Others appreciate the site's comprehensive collection and suggest it as a useful tool for developers and students.
• There is a desire for more interactive and dynamic resources, such as decision trees and guides, to help learners choose the right data structures and algorithms for their problems.
• Some commenters note that the site's finite collection inevitably means that many topics will be missing.
• The site's usefulness is not limited to its comprehensiveness, but also its ability to provide a starting point for further learning and exploration.