Sorter(The Sort Algorithms Viewing Tool)
Sorter is visualization tools for showing how sort algorithm works.
This program is written in Tcl/Tk.
So you can run it under that Tck/Tk can run.
But Sorter isn't Tclet.
Requirement
- Tcl ver7.6 or higher
- Tk ver4.2 or higher
Implemented Algorithms
Sorter has algorithms which is learned in
"Algorithm and Data Structure".
- Simple sort
- Bubble sort
- Double-bubble sort
- Selection sort
- Shaker sort
- Insertion sort
- Shell's sort
- Heap sort
- In place merge sort
- Merge sort
- Natural merge sort
- Quick sort
- Improvement quick sort:=Improvement partitioning+Insertion sort
- LOAS(In Japanese Only)
- Comb sort & comb sort 11
Screen shot
Download
Links
Todo
-
Active sequence hilight at Shell's sort
-
Multilingual Language support
-
Customize via rcfile
-
3D view
-
Sound
History
- Ver1.7(2000/08/09)
- Add comb sort
- Ver1.4(2000/08/08)
- Gradiation color bar
- Ver.1.14E(1998/8/21)
- Some Bug fix.
- Ver.1.13E(1998/8/20)
- Collect implementation for simple sort algorithm and add swap count displaying feature.
- Ver.1.12E(1998/8/12)
- Eliminate verbose "expr"s.
- Ver.1.11E(1998/7/18)
- Add animation feature.
- Ver.1.10E(1998/6/8)
- First English edition.
- Ver.1.05a(1998/2/16)
- Add shaker sort,merge sort and LOAS.
- Ver.1.04a(1998/2/14)
- Add double-bubble sort.
- Ver.1.03a(1998/2/2)
- Some bug fix.
- Ver.1.02a(1998/1/30)
- Add improvement quick sort.
- Ver.1.01a(1998/1/30)
- Remove dependenct about jot and date which are FreeBSD commands.
- Ver.1.00a(1998/12/1)
- Ship first release version.
[
Back to Works|
Back to Labo
]
Takeshi Mutoh
<mutoh@info.nara-k.ac.jp>
$Id: indexE.html,v 1.2 2000/08/09 09:08:53 mutoh Exp $