This website is a dictionary of algorithms, algorithmic techniques, data structures, archetypal problems, and related definitions. It was developed under the editorship of Paul E. Black and contains entries including common functions like Ackermann’s function and problems like traveling salesman and Byzantine generals. Some entries also have links to implementations and additional information. The site does not cover algorithms particular to business data processing, communications, operating systems, distributed algorithms, programming languages, AI, graphics, or numerical analysis. Suggestions, corrections, and comments can be submitted to Paul Black. Teachers can also contact the site for assistance, but users are warned not to use it for cheating.
https://xlinux.nist.gov/dads/