Programming Homework Help

Use the attached to do the following:

1) Change Attached Code to select the pivot as below the right most element.
   a) the left most element
   b) a random number between 1 and 100
   c) the middle element
For each pivot selection , print out the number of comparisons that are needed. Run 100 sorts per type

2) Run 100 sorts of 1000 randomly chosen numbers from 1 to 100. For each test, determine the number of comparisons. Use the first element as the pivot. Output the minimum, maximum and average of this number across the 100 sorts.

3) Generate a series of numbers that cause a n squared number of comparisons, the QuickSort worst case.