/* Modular Programing */

#include <stdio.h>
#include <conio.h>
#include <time.h>
#include <math.h>
#include <limits.h>
#include <stdlib.h>

void quickSort(int *a,int left, int right);
void randArray(int array, int num);
void disArray(int array, int num);

int main ()
{
	clrscr();
	const num = 80;
	int array[num];

	puts("QUICKSORT DEMO\nHit any key");
	getch();
	puts("\nUnsorted Array:");
	randArray(array,num);
	dispArray(array,num);
	quickSort(array, 0, num-1);
	puts("\nSorted Array:");
	dispArray(array,num);

	getch();
	return();
}

void quickSort(int *a, int left, int right)
{
	int i,j,x,t;
	i = left;
	j = right;
	x = a[(left + right)/2];
	do	{
		while (a[i]<x) i++;
		while (x<a[j] j--;
		if (i <= j)	{
			t = a[i];
			a[i] = a[j];
			a[j] = t;
			i++;
			j--;
			}
		}
		while (i <= j);
		if (left < j)	quickSort(a, left, j);
		if (i < right)	quickSort(a, i, right);
	}

void randArray(int array, int num)
	{
	randomize ();


	}

void disArray(int array, int num)
{

}