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

Report as inappropriate.

steveputz presents ...



This demonstrates how merge sort works, by displaying a new row of data for each step in the recursive sort algorithm. It uses color and draws lines to show where the data moves in each step.

3961 views / 772 in the last 7 days

1 vote | 0 in the last 7 days

Tags: demo algorithm sort

Your browser does not support the canvas tag.


can you do the same thing with strings? because we made a piano and we want to sort the keys from a,b,c,.... could you please help because every time I compile it gives an error


Merge sort is one of my favorites. Never tried implementing it in Java, only in C and Pascal. Might be cool to illustrate a balanced tree like an AVL or Red/Black tree (or maybe even a 2-3 tree).

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

Who likes this?