CS 501:  Homework # 2

Part 1:

Extend your sorting framework with two advanced sorting 
methods Shell Sort and Quick Sort. Experiment with two 
different incremental sequences for Shell sort to see how
they affect the algorithm's run time efficiency (count 
the number of comparisons and exchanges). 

Compare the advanced sorting methods that you have 
implemented to elementary sorts from homework 1. Explain
the results generated by your program (do not forget to
experiment with best / worst / avarage cases, if applicable).


Part 2:

Design a recursive method for finding the largest element
in an array A of N elements. Characterize its run-time 
efficiency. Draw the tree of recursive calls to explain 
this result.