WAP to implement Quick Sort.

#include <stdio.h>
#include <stdlib.h>

void quick_sort(int array[], int first, int last)
{
int temp, low, high, midpoint;

low = first;
high = last;
midpoint = array[(first + last) / 2];



do {
while (array[low] < midpoint)
low++;

while (array[high] > midpoint)
high--;

if (low <= high)
{
temp = array[low];
array[low++] = array[high];
array[high--] = temp;
}
} while (low <= high);

if (first < high)
quick_sort(array, first, high);
if (low < last)
quick_sort(array, low, last);
}

void main()
{
int values[100], i;
printf("\n Unsorted list is as follows \n");

for (i = 0; i < 20; i++)
{
values[i] = rand() % 100;
printf(" %d", rand() %100);
}
quick_sort(values, 0, 19);

printf("\n Sorted list as follows\n");

for (i = 0; i < 20; i++)
printf("%d ", values[i]);
}