Algorithm Study provides tools and resources to augment the traditional study of algorithms. It includes implementations of common and less-common algorithms in a variety of languages and visualization tools to help in gaining a deeper understanding of the algorithms. The algorithm implementations are each accompanied by a discussion of the asymptotic ("big O") run time and memory limits of the algorithm. Some implementations include discussion of how the algorithm or data structure is commonly used and comparisons with similar algorithms or data structures. All implementations have test cases that exercise their functionality. The visualization tool, Algorithm Visualizer, displays what happens as various algorithms do their work.
|Tags||Software Development Algorithms|
|Licenses||BSD Revised GPLv2|
|Operating Systems||Mac OS X Linux Windows|
Release Notes: The Algorithm Visualizer program was added. It contains visualizations of the following algorithms: Bubble Sort, Insertion Sort, Quick Sort, and Heap Sort.