脑图
快速排序
#include <stdio.h>
#define MAXLEN 10
int Partition(int A[],int low,int high){
int pivot=A[low];
while (low<high){
while (low<high&&A[high]>=pivot) --high;
A[low] = A[high];
while (low<high&&A[low]<=pivot) ++low;
A[high] = A[low];
}
A[low]=pivot;
return low;
}
void QuickSort(int A[],int low,int high){
if(low<high){
int pivotpos = Partition(A,low,high);
QuickSort(A,low,pivotpos-1);
QuickSort(A,pivotpos+1,high);
}
}
int main() {
int arr[MAXLEN]={0,4,5,6,7,2,1,3,8,9};
QuickSort(arr,0,9);
printf("冒泡排序\n");
for (int i = 0; i < MAXLEN; ++i) {
printf("%d",arr[i]);
}
return 0;
}