//******************************************************************** 
//  QuickSort Assignment
//
//  Using the algorithm from the text book
//********************************************************************

//*********************************************************************
//*  1. Sort all the elements of the int array {5,9,2,1,2,4,3,7}
//*
//*  2. Find a set of 8 numbers that will make the sort run inefficiently
//*  
//*  3. Find a set of 8 numbers that will make the sort run efficiently. (best case)
//*
//*  4. What conditions yield the average case?
//*
//* 
//***********************************************************************