Simple c program for quicksort

Answer 1

#include<stdio.h>

void print(int a[])

{

int i;

for( i=0;i<=8;i++)

{

printf("%d ",a[i]);

}

}

int Qsort(int data[], int left, int right)

{

int mid,tmp,i,j;

i = left;

j = right;

mid = data[(left+right)/2];

do

{

while (data[i] < mid)

i++;

while (mid < data[j])

j--;

if (i <= j)

{

tmp = data[i];

data[i] = data[j];

data[j] = tmp;

i++;

j--;

}

}

while (i <= j);

{

if (left < j)

Qsort(data,left,j);

if (i < right)

Qsort(data,i,right);

}

}

main()

{

int array[]={12,99,4,99,12,12,13,10,13};

printf("Before sort:\n\n");

print(array);

Qsort(array,0,8);

printf("\n\nAfter sort:\n\n");

print(array);

printf("");

}