j-Algo is an algorithm visualization tool, especially useful for students and lecturers of computer science. It is written in Java and platform independent. j-Algo is developed at Dresden University of Technology.

Currently, there are seven modules covering the following topics:
1. AM0-C0: translation of C0 programs into AM0 programs
2. AM1: simulate AM1 programs
3. Algebraic Path Problem: visualises the algebraic path problem
4. AVL trees: visualise binary search trees following the balance algorithm of G.M. Adelson-Velsky and E.M. Landis
5. BFS/DFS: breadth-first search and depth-first search in graphs
6. C0-H0: translation of C0 into H0 programs
7. Dijkstra algorithm: create directed graphs and perform Dijkstra's algorithm to find the shortest way
8. EBNF/syntax diagrams: EBNF definitions and syntax diagrams, the trans() algorithm and interactive word creation
9. Heapsort: the sorting algorithm Heapsort
10. Hoare Calculus: verification of a C0-program using the Hoare calculus (new version)
11. Knuth Morris Pratt: visualisation of the KMP search algorithm
12. Lambda Calculus: converting and reducing -terms
13. Pulsing Memory: helps understanding the concepts of a stack and pointers
14. Unification: unification of terms

Requirements:
* Java

The license of this software is Free, you can free download and free use this application software.