CS 241 Data Structures- Lab 5, Due 3/21

Sort Timing

Just like last lab, your task for this lab is to implement two O(nlogn) sorts: quick sort, and merge sort. Time them on various sized lists to verify they are actually O(nlogn).

Approach

Work in pairs! Two heads are... um... more than one.
One partner can write merge while the other writes quick; then you can help each other debug! And, you can insist your partner programs defensively! Demo your code during lab for credit.

Extra credit

Implement and time counting sort as well (see class notes).