j-Algo

j-Algo is an easy to use algorithm visualization application, especially useful for students and lecturers of computer science.

Currently, there are seven modules covering the following topics: · Algebraic Path Problem: visualises the algebraic path problem · AVL trees: visualise binary search trees following the balance algorithm of G.M. Adelson-Velsky and E.M. Landis · Dijkstra algorithm: create directed graphs and perform Dijkstra's algorithm to find the shortest way · EBNF/syntax diagrams: EBNF definitions and syntax diagrams, the trans() algorithm and interactive word creation · Heapsort: the sorting algorithm Heapsort · Hoare Calculus: verification of a C0-program using the Hoare calculus (new version) · Knuth Morris Pratt: visualisation of the KMP search algorithm · Lambda Calculus: converting and reducing ?-terms · Pulsing Memory: helps understanding the concepts of a stack and pointers