CSC 230 - Lab 4 : 
Using the following list of numbers : 12 4 3 8 6 15 2 5 21, 
(a)	Trace the QuickSort algorithm and point out all partitions, partition elements and partition indices as the algorithm recursively executes (as the example demonstrated in class). 
(b)	Draw a tree of calls (as shown in class) indicating : (i calls made by quicksort to quicksort listing the partition boundaries in each call, (ii) the order in which the calls were made. 
(c)	Trace the MergeSort algorithm and point out : (i) all halves created as the algorithm recursively executes (as the example demonstrated in class), as well as (ii) all sorted halves created by the algorithm.