#include <stdio.h>
void quickSort(int arr[], int low, int high)
{
int first = low;
int last = high;
int key = arr[first];
if(low >= high)
return;
while(first < last)
{
while(first < last && arr[last] > key)
{
last--;
}
arr[first] = arr[last];
while(first < last && arr[first] < key)
{
first++;
}
arr[last] = arr[first];
}
arr[first] = key;
for(int i = 0; i < 7; i++)
printf("%d ", arr[i]);
printf("\n");
quickSort(arr, low, first-1);
quickSort(arr, first+1, high);
}
int main()
{
int i;
int a[7] = {21, 25, 5, 17, 9, 23, 30};
for(i = 0; i < 7; i++)
printf("%d ", a[i]);
printf("\n");
quickSort(a, 0, 6);
for(i = 0; i < 7; i++)
printf("%d ", a[i]);
printf("\n");
return 0;
}
01-18
645
06-13