February 4th, 2015

Recursive sorts are not easy to follow and you might want to watch the video again. Also, we will have a few more exercises for you to practice.
James found a good source to share with all of you:

Classwork:
4. Under what conditions you have the worse case?
5. What data would yield to a best case and average case?
6. What is the big O notation for this sort for each case?
Homework:
7. Can you think of a non-recursive QuickSort?
8. Find a different algorithm for QuickSort in the internet.
9. Write code for QuickSorting objects. Include compareTo() and toString() methods of the object’s class.

NOTE for Phil: You were right. My bad.