int partion( int array[], int start, int end )
{
    int temple = array[start] ;

	while( start < end )
	{
	    while( end > start && array[end] >= temple ) end-- ;
		array[start] = array[end] ;
		while( start < end && array[start] <= temple ) start++ ;
		array[end] = array[start] ;
	}

	array[end] = temple ;

	return end ;
}

void QuickSort( int array[], int start, int end ) 
{
   if( start >= end )
	   return ;

   int middle = partion( array, start, end ) ;

   QuickSort( array, start, middle - 1 ) ;
   QuickSort( array, middle + 1, end ) ;
}