Algorithm Elf 1.2.2
||A graphical way to show the implementation process of the most data structure algorithms. Applicable to the production of algorithms course and help the students understanding of the software algorithm for the implementation process.
||August 29, 2009
||Linux platform, select one of the following format:
Windows platform, local downloads:
Note: The registration code will be sent to you by email automatically as soon as the payment is complete, and it's applied to both Windows and Linux platforms.
What is Algorithm Elf anyway?
A graphical way to show the implementation process of the most data structure algorithms. Applicable to the production of algorithms course and help the students understanding of the software algorithm for the implementation process.
Algorithm elf uses the animation way to show memory data, heap stack data changes in an intuitive display that can help you understand the algorithm implementation. The process of these animations can be extracted to design courseware material.
Most of the classical algorithm is built-in . Each algorithm can be used as a game. In the course of the game, you need set the image attributes, or fill in the correct data values by the algorithms, so he can continue the game or have the points (the game features in the current version has not yet achieved).
Algorithm wizard also allows you to write your algorithms in Pascal Language, build and run the algorithm. Through the graphical Algorithm-based approach to demonstrate the implementation process, to discover problems in algorithm design and better improved algorithm. you can add breakpoints and watchpoints in the execution process even.
Algorithm Animation, as well as the view of stack changing and source code.
Step by step to show the implementation of algorithm.
Using datapool to config the initial parameters of each algorithm.
Input the tree, grpah of the parameters by the graphical sytle.
Replay the animation process of algorithm implementation.
The algorithms have been implementated:
* Tower of Hanoi recursive algorithm
* Binary Tree Traversal
* Build a thread binary tree.
* Prime algorithm
* Straight Sort
* Bubble Sort
* Merging Sort
You can add new algorithm written by pascal, build it and play it. And you can debug the algorithm, set the breakpoints and watchpoints. Algorithm Elf can displays the data changes in the implementation process, using an intuitive way of showing the problem of algorithm.
Multi-platform support, now internationalization of Chinese and English only.
Send an email to: firstname.lastname@example.org, thanks.
Last updated by Jondy Zhao @ 2010-11-06 14:48 + China Standard Time