/**qsort.c: quick sort. divide-and-conquer
*/
#include<stdio.h>
void qsort(int v[], int left, int right);
main(void)
{
int i=0;
int a[5] = {5,4,3,2,1};
qsort(a, 0, 4);
while(i < 5) {
printf("%d ", a[i]);
i++;
}
printf("\n");
return 0;
}
void qsort(int v[], int left, int right)
{
int i, last;
void swap(int v[], int i, int j);
if(left >= right)
return;
swap(v, left, (left+right)/2);
last = left;
for(i=left+1; i<=right; i++)
if(v[i]<v[left])
swap(v, ++last, i);
swap(v, left, last);
qsort(v, left, last - 1);
qsort(v, last+1, right);
}
void swap(int v[], int i, int j)
{
int temp;
temp = v[i];
v[i] = v[j];
v[j] = temp;
}
*/
#include<stdio.h>
void qsort(int v[], int left, int right);
main(void)
{
int i=0;
int a[5] = {5,4,3,2,1};
qsort(a, 0, 4);
while(i < 5) {
printf("%d ", a[i]);
i++;
}
printf("\n");
return 0;
}
void qsort(int v[], int left, int right)
{
int i, last;
void swap(int v[], int i, int j);
if(left >= right)
return;
swap(v, left, (left+right)/2);
last = left;
for(i=left+1; i<=right; i++)
if(v[i]<v[left])
swap(v, ++last, i);
swap(v, left, last);
qsort(v, left, last - 1);
qsort(v, last+1, right);
}
void swap(int v[], int i, int j)
{
int temp;
temp = v[i];
v[i] = v[j];
v[j] = temp;
}