I've done a lot of sorting algorithms work from CSC148, so it was interesting to get to look at those algorithms in greater detail in this class.
I thought this link was really cool:
http://9gag.com/gag/aPyoG4P
You'll see that the image includes insertion and selection sort. It also provides a good representation of why best-case (nearly sorted) analysis isn't very helpful, since most algorithms finished that very quickly.
Neato! You can also check out the original animation and meddle with it at:
ReplyDeletehttp://www.sorting-algorithms.com/