随机产生300个整数构成的序列,分别以直接插入、冒泡、希尔、快速、归并排序,统计各自比较次数。c语言
时间: 2023-06-20 13:09:04 浏览: 53
以下是使用C语言实现的代码:
```c
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
// 直接插入排序
int directInsertionSort(int arr[], int n) {
int i, j, key, count = 0;
for (i = 1; i < n; i++) {
key = arr[i];
j = i - 1;
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j--;
count++;
}
arr[j + 1] = key;
count++;
}
return count;
}
// 冒泡排序
int bubbleSort(int arr[], int n) {
int i, j, temp, flag, count = 0;
for (i = 0; i < n - 1; i++) {
flag = 0;
for (j = 0; j < n - 1 - i; j++) {
if (arr[j] > arr[j + 1]) {
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
flag = 1;
count++;
}
count++;
}
if (flag == 0) {
break;
}
}
return count;
}
// 希尔排序
int shellSort(int arr[], int n) {
int i, j, gap, temp, count = 0;
for (gap = n / 2; gap > 0; gap /= 2) {
for (i = gap; i < n; i++) {
temp = arr[i];
for (j = i - gap; j >= 0 && arr[j] > temp; j -= gap) {
arr[j + gap] = arr[j];
count++;
}
arr[j + gap] = temp;
count++;
}
}
return count;
}
// 快速排序
int quickSort(int arr[], int left, int right) {
int i, j, pivot, temp, count = 0;
if (left < right) {
i = left;
j = right;
pivot = arr[left];
while (i < j) {
while (i < j && arr[j] >= pivot) {
j--;
count++;
}
if (i < j) {
arr[i] = arr[j];
i++;
count++;
}
while (i < j && arr[i] < pivot) {
i++;
count++;
}
if (i < j) {
arr[j] = arr[i];
j--;
count++;
}
}
arr[i] = pivot;
count++;
count += quickSort(arr, left, i - 1);
count += quickSort(arr, i + 1, right);
}
return count;
}
// 归并排序
void merge(int arr[], int left, int mid, int right, int *count) {
int i, j, k;
int n1 = mid - left + 1;
int n2 = right - mid;
int L[n1], R[n2];
for (i = 0; i < n1; i++) {
L[i] = arr[left + i];
}
for (j = 0; j < n2; j++) {
R[j] = arr[mid + 1 + j];
}
i = j = 0;
k = left;
while (i < n1 && j < n2) {
if (L[i] <= R[j]) {
arr[k] = L[i];
i++;
} else {
arr[k] = R[j];
j++;
}
(*count)++;
}
while (i < n1) {
arr[k] = L[i];
i++;
k++;
(*count)++;
}
while (j < n2) {
arr[k] = R[j];
j++;
k++;
(*count)++;
}
}
int mergeSort(int arr[], int left, int right) {
int count = 0;
if (left < right) {
int mid = left + (right - left) / 2;
count += mergeSort(arr, left, mid);
count += mergeSort(arr, mid + 1, right);
merge(arr, left, mid, right, &count);
}
return count;
}
int main() {
int n = 300;
int arr[n];
int i, count;
// 随机生成300个整数
srand((unsigned int) time(NULL));
for (i = 0; i < n; i++) {
arr[i] = rand() % 100;
}
// 直接插入排序
count = directInsertionSort(arr, n);
printf("直接插入排序比较次数:%d\n", count);
// 冒泡排序
count = bubbleSort(arr, n);
printf("冒泡排序比较次数:%d\n", count);
// 希尔排序
count = shellSort(arr, n);
printf("希尔排序比较次数:%d\n", count);
// 快速排序
count = quickSort(arr, 0, n - 1);
printf("快速排序比较次数:%d\n", count);
// 归并排序
count = mergeSort(arr, 0, n - 1);
printf("归并排序比较次数:%d\n", count);
return 0;
}
```
其中,直接插入排序、冒泡排序、希尔排序、快速排序和归并排序的比较次数分别通过参数 `count` 统计得出,并在最后输出。