分治法实现快速排序c语言
时间: 2023-07-11 15:47:39 浏览: 59
好的,下面是分治法实现快速排序的 C 语言代码:
```c
#include <stdio.h>
void quicksort(int arr[], int left, int right) {
int i, j, temp, pivot;
if (left < right) {
pivot = left;
i = left;
j = right;
while (i < j) {
while (arr[i] <= arr[pivot] && i < right)
i++;
while (arr[j] > arr[pivot])
j--;
if (i < j) {
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
temp = arr[pivot];
arr[pivot] = arr[j];
arr[j] = temp;
quicksort(arr, left, j - 1);
quicksort(arr, j + 1, right);
}
}
int main() {
int arr[] = {57, 68, 59, 52, 72, 28, 96, 33, 24};
int n = sizeof(arr) / sizeof(arr[0]);
printf("Original array: ");
for (int i = 0; i < n; i++)
printf("%d ", arr[i]);
quicksort(arr, 0, n - 1);
printf("\nSorted array: ");
for (int i = 0; i < n; i++)
printf("%d ", arr[i]);
return 0;
}
```
这个算法的时间复杂度为 O(n log n)。