以下是一个使用 C 语言实现上述内部排序算法比较的示例代码： ```c #include <stdio.h> #include <stdlib.h> #include <time.h> // 交换两个元素 void swap(int *a, int *b) { int temp = *a; *a = *b; *b = temp; } // 打印数组 void printArray(int arr[], int size) { for (int i = 0; i < size; i++) printf("%d ", arr[i]); printf("\n"); } // 直接插入排序 void insertionSort(int arr[], int n, int *passes, int *comparisons, int *moves) { int i, key, j; *passes = 0; *comparisons = 0; *moves = 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 = j - 1; (*comparisons)++; (*moves) += 3; } arr[j + 1] = key; (*moves) += 3; (*passes)++; } } // 希尔排序 void shellSort(int arr[], int n, int *passes, int *comparisons, int *moves) { int gap, i, j, temp; *passes = 0; *comparisons = 0; *moves = 0; for (gap = n / 2; gap > 0; gap = gap / 2) { for (i = gap; i < n; i++) { temp = arr[i]; for (j = i; j >= gap && arr[j - gap] > temp; j -= gap) { arr[j] = arr[j - gap]; (*comparisons)++; (*moves) += 3; } arr[j] = temp; (*moves) += 3; (*passes)++; } } } // 冒泡排序 void bubbleSort(int arr[], int n, int *passes, int *comparisons, int *moves) { int i, j; *passes = 0; *comparisons = 0; *moves = 0; for (i = 0; i < n - 1; i++) { for (j = 0; j < n - i - 1; j++) { if (arr[j] > arr[j + 1]) { swap(&arr[j], &arr[j + 1]); (*comparisons)++; (*moves) += 3; } } (*passes)++; } } // 快速排序 void quickSort(int arr[], int low, int high, int *passes, int *comparisons, int *moves) { int pivot, i, j; if (low < high) { pivot = low; i = low; j = high; while (i < j) { while (arr[i] <= arr[pivot] && i < high) { i++; (*comparisons)++; } while (arr[j] > arr[pivot]) { j--; (*comparisons)++; } if (i < j) { swap(&arr[i], &arr[j]); (*moves) += 3; } } swap(&arr[pivot], &arr[j]); (*moves) += 3; quickSort(arr, low, j - 1, passes, comparisons, moves); quickSort(arr, j + 1, high, passes, comparisons, moves); (*passes)++; } } // 归并排序 void merge(int arr[], int l, int m, int r, int *comparisons, int *moves) { int n1 = m - l + 1; int n2 = r - m; int L[n1], R[n2]; for (int i = 0; i < n1; i++) L[i] = arr[l + i]; for (int j = 0; j < n2; j++) R[j] = arr[m + 1 + j]; int i = 0, j = 0, k = l; while (i < n1 && j < n2) { if (L[i] <= R[j]) { arr[k++] = L[i++]; (*comparisons)++; } else { arr[k++] = R[j++]; (*comparisons)++; } (*moves) += 3; } while (i < n1) { arr[k++] = L[i++]; (*moves) += 3; } while (j < n2) { arr[k++] = R[j++]; (*moves) += 3; } } void mergeSort(int arr[], int l, int r, int *passes, int *comparisons, int *moves) { if (l < r) { int m = l + (r - l) / 2; mergeSort(arr, l, m, passes, comparisons, moves); mergeSort(arr, m + 1, r, passes, comparisons, moves); merge(arr, l, m, r, comparisons, moves); (*passes)++; } } // 简单选择排序 void selectionSort(int arr[], int n, int *passes, int *comparisons, int *moves) { int i, j, min_idx; *passes = 0; *comparisons = 0; *moves = 0; for (i = 0; i < n - 1; i++) { min_idx = i; for (j = i + 1; j < n; j++) { if (arr[j] < arr[min_idx]) min_idx = j; (*comparisons)++; } if (min_idx!= i) { swap(&arr[i], &arr[min_idx]); (*moves) += 3; } (*passes)++; } } // 生成随机测试数据 void generateRandomData(int arr[], int n) { srand(time(NULL)); for (int i = 0; i < n; i++) arr[i] = rand() % 1000; } // 比较各种排序算法的性能 void compareSortingAlgorithms() { int choice, n = 60, arr[n], passes, comparisons, moves; int ascending = 1; printf("选择排序算法：\n1. 直接插入排序\n2. 希尔排序\n3. 冒泡排序\n4. 快速排序\n5. 归并排序\n6. 简单选择排序\n"); scanf("%d", &choice); printf("选择排序顺序（1 为升序，0 为降序）："); scanf("%d", &ascending); generateRandomData(arr, n); switch (choice) { case 1: insertionSort(arr, n, &passes, &comparisons, &moves); break; case 2: shellSort(arr, n, &passes, &comparisons, &moves); break; case 3: bubbleSort(arr, n, &passes, &comparisons, &moves); break; case 4: quickSort(arr, 0, n - 1, &passes, &comparisons, &moves); break; case 5: mergeSort(arr, 0, n - 1, &passes, &comparisons, &moves); break; case 6: selectionSort(arr, n, &passes, &comparisons, &moves); break; default: printf("无效的选择\n"); return; } if (ascending) { printf("升序排序结果："); } else { printf("降序排序结果："); } printArray(arr, n); printf("排序趟数：%d\n", passes); printf("关键字比较次数：%d\n", comparisons); printf("元素移动次数：%d\n", moves); } int main() { int numTests = 5; for (int i = 0; i < numTests; i++) { compareSortingAlgorithms(); } return 0; } ``` 以下是三个可行的改进建议： 1. 增加错误处理机制，例如在用户输入非法选择时给出更友好的提示。 2. 对生成的随机测试数据进行范围限制，以更好地控制测试数据的分布。 3. 优化代码的注释，使其更清晰地解释每个函数的功能和复杂的逻辑部分。 [2024-12-26 08:43:56 | AI写代码神器 | 2182点数解答]