void quickSort(int numbers[], int array_size)
{
q_sort(numbers, 0, array_size - 1);
}
void q_sort(int numbers[], int left, int right)
{
int pivot, l_hold, r_hold;
l_hold = left;
r_hold = right;
pivot = numbers
;
while (left < right)
{
while ((numbers
>= pivot) && (left < right))
right--;
if (left != right)
{
numbers
= numbers
;
left++;
}
while ((numbers
<= pivot) && (left < right))
left++;
if (left != right)
{
numbers
= numbers
;
right--;
}
}
numbers
= pivot;
pivot = left;
left = l_hold;
right = r_hold;
if (left < pivot)
q_sort(numbers, left, pivot-1);
if (right > pivot)
q_sort(numbers, pivot+1, right);
}