Homework-15 quick sort

Assignment to do Wednesday...

1. Get your quicksort algorithm working.

2. Add hybrid qualities to your quicksort function.
   a. Check to see if the array is small.
   b. If small enough, do not partition, but call bubble-sort instead.
   c. Write a bubble-sort that only sorts from array-start to array-end. 




How to test your partition program:

1. Display the random array, and pivot value.

2. Partition the array once.

3. Display the partitioned array, and the value of j.

Look at the output to see if it is working.

The psuedocode that we used from Wikipedia should work,
but it is difficult to tell without showing the output above.