Computer Science 15-110, Lecture 9 (Sections M-Q), Fall 2009
Optional Lab 9 (Animated Processes)
Due:  Thu 3-Dec-2009 at 10pm (email copy to your CA)
(no late submissions accepted).

This lab is optional.  The grade will only count if it improves your overall lab+hw grade.

Read these instructions first!

• The lab instructions from lab2 all apply here.
   
• As explained in that document:
  • Submit your free-response answers in a single file named Lab9.txt (or .doc, .pdf, .rtf, or .html -- but not .docx!).
  • Your top-level directory (which must exist) should be named lab9-<andrewId>.  Submit a zipped version of this.
  • Do not submit .java~ files, .class files, project files, or any other extraneous files.
  • Place all your non-graphics, non-bonus answers in the file Lab9.java.
     
• While collaboration is not required on this lab, it is very strongly encouraged.

• Style counts!!!  Use well-named variables, proper indenting, reasonable commenting, etc.
   
• There are no limitations on what Java concepts you use at this point in the course.

1. Optional:  Animated Sorts
2. Bonus/Optional:  More Animated Processes

1. Optional:  Animated Sorts
   Using the techniques we covered in class for animating processes, write a program that animates one of the quadratic sorts that we have covered (bubble, insertion, or selection).  Make your interface compelling.  If you are unsure of how to design this, you may base your interface on David Eck's xSortLab (select "Visual Sort", then "Fast", then "Go").
    

2. Bonus/Optional:  More Animated Processes
   Animate the quicksort algorithm.  This is a recursive algorithm which would be challenging to animate without the techniques used here.  After quicksort, you may animate other interesting recursive algorithms, such as Towers of Hanoi or Flood Fill.

Carpe diem!