Report as inappropriate.
This program implements a few sorting algorithms in Greenfoot, namely min sort, max sort, bubble sort, insertion sort and quick sort.
Each is sorting a graph of integer numbers showing the processes visually (it's more accurate for the selection sort algorithms).
For some reason max sort is slower than min sort, but I don't know why.
Implementing algorithms was a project for lesson, though visualization was optional.
9394 views / 1172 in the last 7 days
10 votes | 0 in the last 7 days
To embed this scenario in a web page, copy the following HTML code:
Want to leave a comment? You must first log in.