Paper: Naps2000
JHAVÉ is a java application that renders algorithm visualizations. Students explore algorithms by viewing visual representations of data, controlling movement and by responding to pop-up questions. The JHAVÉ site includes a large collection of free materials for students and faculty to use.
JHAVÉ currently supports algorithm visualizations in three different scripting languages: GAIGS, Animal, and XAAL.
The JHAVÉ project principal investigators are Thomas Naps (naps@uwosh.edu), Scott Grissom, and Myles McNally.
Most of the AVs have an HTML page that discusses the associated topic. The AV itself is typically a series of "slides", and there are associated pop-up questions for the user to answer.
JHAVÉ was being actively maintained and summer students were actively developing new modules as of Summer 2009.
Topics:
Sorting
- Bubble Sort
- Selection Sort
- Insertion Sort
- Heap Sort
- Merge Sort
- Quick Sort
- Shell Sort
Graph Algorithms
- A-Star Search
- Beam Search
- Best First Search
- Depth and Breadth-first Search
- Dijkstra's Algorithm
- Floyd's Algorithm
- Kruskal's MST
- Prim's MST
Hashing
- Linear Hashing
- Chained Hashing
- Double Hashing
- Quadratic Hashing
Miscellaneous
- Binary Search Trees
- Red-black Trees
- Huffman Encoding
- Huffman Decoding
- Stack-based Parsing