快排运用到了递归的思想:【记住】
#include <stdio.h>
void QuitSort(int *arr, int left, int right);
void printArr(int *arr, int s);
int main()
{
int arr[] = {5, 654, 6, 654, 2, 88};
int size = sizeof(arr)/sizeof(int);
printArr(arr, size);
QuitSort(arr, 0, size-1);
printArr(arr, size);
return 0;
}
void QuitSort(int *arr, int left, int right)
{
int l, r, temp, tt;
if (left < right) {
l = left;
r = right;
temp = arr[left];
while (l != r) {
while (arr[r]>=temp && l<r) r--;
while (arr[l]<=temp && l<r) l++;
if (l<r) {
tt = arr[l];
arr[l] = arr[r];
arr[r] = tt;
}
}
//r == l
arr[left] = arr[r];
arr[r] =