C语言快速排序(1).zip

#define _CRT_SECURE_NO_WARNINGS 1 #include<stdio.h> void quick_sort(int* arr, int p, int r) { if (p < r) { int q = partition(arr, p, r); quick_sort(arr, p, q-1); quick_sort(arr, q + 1, r); } } int partition(int* arr, int p, int r) { int x = arr[r]; int i = p - 1; int j; for (j = p; j <= r - 1; ++j) { if (arr[j] <= x) { ++i; int tmp = arr[i]; arr[i] = arr[j]; arr[j] = tmp; } } int tmp = arr[i + 1]; arr[i + 1] = arr[r]; arr[r] = tmp; return i + 1; } int main() { int arr[10] = { 34,12,98,67,38,92,17,38,60,20 }; int i = 0, length = 9; quick_sort(arr, i, length); for (i = 0; i <= length; i++) printf("%d ", arr[i]); return 0; }