/*
   The quick sort is an in-place, 
   divide-and-conquer, 
   massively recursive sort.

   1. Choose a pivot elemnt based 
      on middle of three(L, R, Middle)
   2. Swap the pivot with last element(R)
   3. Start searching from left, 
      if (number[left]>=pivot 
	   || left_index > right_index) 
	  {
	    stop();
	  }
   4. Start seaching from right, 
      if (number[right]<=pivot
	  || right_index < left_index)
	  { 
	    if (left_index!=right_index)
		{
		  swap the two element;
		}
		else
		{
		  swap the last element(pivot) 
		  most left element;
		}
	5. If both group more than 1 element
	   {
	      perform quick sort
	   }
	   else
	   {
	      done;
	   }
*/

#include<iostream>

using std::cout;
using std::cin;

void quickSort(int [], int);

// -----------------------------------------

int main(int argc, char *argv[])
{
	int number[] = {5, 4, 2, 3, 1};
	quickSort(number, 5);
	return 0;
}
// -----------------------------------------
void quickSort(int number[], int size)
{
	int leftptr = number[0];
	int rightptr = number[size - 1];
	int middle = size / 2;
	int tempPivot, pivot;
	int temp;

	/* Select a pivot based on middle of
       three
    */
	if (number[leftptr] > number[rightptr])
	{
		tempPivot = number[rightptr];
		if (tempPivot > number[middle])
		{
			pivot = tempPivot;
		}
		else
		{
			pivot = number[middle];
		}
	}
	else
	{
		tempPivot = number[leftptr];
		if (tempPivot > number[middle])
		{
			pivot = tempPivot;
		}
		else
		{
			pivot = number[middle];
		}
	}
	temp = pivot;
	pivot = number[rightptr];
	number[rightptr] = pivot;

}