void quicksort(int begin, int end, int arr[]) {
int i, j, temp, t;
if (begin > end)
return;
i = begin, j = end, temp = arr[begin];
while (i != j) {
while (arr[j] >= temp && i < j)
j--;
while (arr[i] <= temp && i < j)
i++;
if (i < j) {
t = arr[j];
arr[j] = arr[i];
arr[i] = t;
}
}
arr[begin] = arr[i];
arr[i] = temp;
quicksort(begin, i - 1,arr);
quicksort(i + 1, end,arr);
}
快速排列的c语言实现
Guess you like
Origin blog.csdn.net/just_a_fresh_man/article/details/121184258
Ranking