Sorting Demonstration
This applet is written by David Eck (here is the original page).
In this course, we only do bubble, insertion, and selection sort.
They are good for small lists (but very slow for very big lists).
Note that in java array indices start from 0, but in this demo they start form 1. Also, note that our selection sort moves min to the beginning
of the list while this code moves max to the end of the list.
You may need to wait a bit for the applet to load.