This site requires JavaScript, please enable it in your browser!
Greenfoot back

Report as inappropriate.

trash1000
trash1000 presents ...

2010/7/16

Algorithms

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.

5917 views / 11 in the last 7 days

10 votes | 0 in the last 7 days

Tags: simulation sorting algorithm minsort maxsort bubblesort quicksort insertionsort

Your browser does not support the canvas tag.
SPowerSPower

2012/9/22

Can you add quick sort?
trash1000trash1000

2012/9/22

Well, I do have a python implementation of quick sort and it wouldn't be too difficult to implement it in Java. However, I'm not too sure whether I could visualize it the way I did with the selection sort algorithms.
SPowerSPower

2012/9/22

Ok, I understand
A new version of this scenario was uploaded on Sun Sep 23 10:32:28 UTC 2012
trash1000trash1000

2012/9/23

Ok, I added quick sort for you, SPower. However I couldn't accurately visualize how it works.
SPowerSPower

2012/9/23

Thanks! Great job!
A new version of this scenario was uploaded on Sun Sep 23 15:09:15 UTC 2012 Added the insertion sort algorithm and tweaked the appearance a little.
Game/maniacGame/maniac

2012/11/28

It has algorithms so it must be good
JetLennitJetLennit

2013/4/13

Source?
trash1000trash1000

2013/4/13

@JetLennit Won't be published, sorry.

See all comments

Want to leave a comment? You must first log in.

Who likes this?

PigPen JetLennit mjrb4 Kartoffelbrot Game/maniac Gevater_Tod4711 SPower ChrisSchütt mik SuperGenius