A Quicksort (or Partition Exchange Sort) divides the data into 2 partitions separated by a pivot

A Quicksort (or Partition Exchange Sort) divides the data into 2 partitions separated by a pivot. The first partition 
contains all the items which are smaller than the pivot. The remaining items are in the other partition. You will write four 
versions of Quicksort:
? Select the first item of the partition as the pivot. Treat partitions of size one and two as stopping cases.
? Same pivot selection. For a partition of size 100 or less, use an insertion sort to finish. 
? Same pivot selection. For a partition of size 50 or less, use an insertion sort to finish. 
? Select the median-of-three as the pivot. Treat partitions of size one and two as stopping cases.
As time permits consider examining additional, alternate methods of selecting the pivot for Quicksort.