换成C语言
时间: 2023-06-22 07:18:59 浏览: 49
好的,这里是快速排序和归并排序的C语言实现:
快速排序:
```c
#include <stdio.h>
void swap(int *a, int *b) {
int temp = *a;
*a = *b;
*b = temp;
}
int partition(int arr[], int low, int high) {
int pivot = arr[high];
int i = low - 1;
for (int j = low; j < high; j++) {
if (arr[j] < pivot) {
i++;
swap(&arr[i], &arr[j]);
}
}
swap(&arr[i+1], &arr[high]);
return (i+1);
}
void quick_sort(int arr[], int low, int high) {
if (low < high) {
int pi = partition(arr, low, high);
quick_sort(arr, low, pi-1);
quick_sort(arr, pi+1, high);
}
}
int main() {
int arr[] = {64, 34, 25, 12, 22, 11, 90};
int n = sizeof(arr) / sizeof(arr[0]);
quick_sort(arr, 0, n-1);
printf("排序后的数组:\n");
for (int i = 0; i < n; i++) {
printf("%d ", arr[i]);
}
return 0;
}
```
输出结果:
```
排序后的数组:
11 12 22 25 34 64 90
```
归并排序:
```c
#include <stdio.h>
#include <stdlib.h>
void merge(int arr[], int left[], int n_left, int right[], int n_right) {
int i = 0, j = 0, k = 0;
while (i < n_left && j < n_right) {
if (left[i] < right[j]) {
arr[k++] = left[i++];
} else {
arr[k++] = right[j++];
}
}
while (i < n_left) {
arr[k++] = left[i++];
}
while (j < n_right) {
arr[k++] = right[j++];
}
free(left);
free(right);
}
void merge_sort(int arr[], int n) {
if (n <= 1) {
return;
}
int mid = n / 2;
int *left = (int*) malloc(mid * sizeof(int));
int *right = (int*) malloc((n - mid) * sizeof(int));
for (int i = 0; i < mid; i++) {
left[i] = arr[i];
}
for (int i = mid; i < n; i++) {
right[i - mid] = arr[i];
}
merge_sort(left, mid);
merge_sort(right, n - mid);
merge(arr, left, mid, right, n - mid);
}
int main() {
int arr[] = {64, 34, 25, 12, 22, 11, 90};
int n = sizeof(arr) / sizeof(arr[0]);
merge_sort(arr, n);
printf("排序后的数组:\n");
for (int i = 0; i < n; i++) {
printf("%d ", arr[i]);
}
return 0;
}
```
输出结果:
```
排序后的数组:
11 12 22 25 34 64 90
```
以上两种算法均有相应的C语言实现,可以根据自己的需求选择使用。