The Most Complex Machine - xSortLab - Quadratic Sorts
Recommendation |
Recommended |
||||
Link |
|||||
Delivery Method |
Java Application |
||||
License |
Non-OSI Open Source |
||||
Language |
English |
||||
Author |
David Eck |
||||
Institution |
Hobart and William Smith Colleges |
||||
Project |
xSortLab |
||||
Works |
Yes |
||||
Description |
Bubble, Insertion, Selection, Quick, and Merge Sorts. Bar-swapping in a stepwise or continuous fashion with explanations of the code taking place. Instrumented for AlgorithmSimulation (compares and copies). Also has a separate simulation mode which dispenses with the swapping bars. |
||||
Evaluation |
One of the best swapping-bars visualizations, since it includes a stepwise component. Main drawback is no ability to add your own datasets, and the built-in dataset is randomized each time. |
||||
|
|||||
Teaching the Concept; Comparison |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-09-06 |
||||
Last Visited |
2010-02-11 |
||||
Last Updated |
1997-08-01 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
