用C语言编程实现直接插入排序、希尔排序、冒泡排序、快速排序、选择排序和堆排序，要有菜单

好的，下面是代码实现： ```c #include <stdio.h> #include <stdlib.h> // 直接插入排序 void insertion_sort(int arr[], int n) { int i, j, temp; for (i = 1; i < n; i++) { temp = arr[i]; j = i - 1; while (j >= 0 && arr[j] > temp) { arr[j + 1] = arr[j]; j--; } arr[j + 1] = temp; } } // 希尔排序 void shell_sort(int arr[], int n) { int gap, i, j, temp; for (gap = n / 2; gap > 0; 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]; } arr[j] = temp; } } } // 冒泡排序 void bubble_sort(int arr[], int n) { int i, j, temp; for (i = 0; i < n - 1; i++) { for (j = 0; j < n - i - 1; j++) { if (arr[j] > arr[j + 1]) { temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } } } } // 快速排序 void quick_sort(int arr[], int left, int right) { if (left >= right) { return; } int i = left, j = right, pivot = arr[left]; while (i < j) { while (i < j && arr[j] >= pivot) { j--; } arr[i] = arr[j]; while (i < j && arr[i] <= pivot) { i++; } arr[j] = arr[i]; } arr[i] = pivot; quick_sort(arr, left, i - 1); quick_sort(arr, i + 1, right); } // 选择排序 void selection_sort(int arr[], int n) { int i, j, min_index, temp; for (i = 0; i < n - 1; i++) { min_index = i; for (j = i + 1; j < n; j++) { if (arr[j] < arr[min_index]) { min_index = j; } } temp = arr[i]; arr[i] = arr[min_index]; arr[min_index] = temp; } } // 堆排序 void heap_sort(int arr[], int n) { int i, temp; for (i = (n - 1) / 2; i >= 0; i--) { heapify(arr, n, i); } for (i = n - 1; i >= 0; i--) { temp = arr[0]; arr[0] = arr[i]; arr[i] = temp; heapify(arr, i, 0); } } void heapify(int arr[], int n, int i) { int largest = i, left = 2 * i + 1, right = 2 * i + 2, temp; if (left < n && arr[left] > arr[largest]) { largest = left; } if (right < n && arr[right] > arr[largest]) { largest = right; } if (largest != i) { temp = arr[i]; arr[i] = arr[largest]; arr[largest] = temp; heapify(arr, n, largest); } } int main() { int choice, n, i, *arr; while (1) { printf("\nSorting Algorithm Menu\n\n"); printf("1. Insertion Sort\n"); printf("2. Shell Sort\n"); printf("3. Bubble Sort\n"); printf("4. Quick Sort\n"); printf("5. Selection Sort\n"); printf("6. Heap Sort\n"); printf("7. Exit\n\n"); printf("Enter your choice: "); scanf("%d", &choice); switch (choice) { case 1: printf("Enter the number of elements: "); scanf("%d", &n); arr = (int *) malloc(n * sizeof(int)); printf("Enter the elements: "); for (i = 0; i < n; i++) { scanf("%d", &arr[i]); } insertion_sort(arr, n); printf("Sorted array: "); for (i = 0; i < n; i++) { printf("%d ", arr[i]); } free(arr); break; case 2: printf("Enter the number of elements: "); scanf("%d", &n); arr = (int *) malloc(n * sizeof(int)); printf("Enter the elements: "); for (i = 0; i < n; i++) { scanf("%d", &arr[i]); } shell_sort(arr, n); printf("Sorted array: "); for (i = 0; i < n; i++) { printf("%d ", arr[i]); } free(arr); break; case 3: printf("Enter the number of elements: "); scanf("%d", &n); arr = (int *) malloc(n * sizeof(int)); printf("Enter the elements: "); for (i = 0; i < n; i++) { scanf("%d", &arr[i]); } bubble_sort(arr, n); printf("Sorted array: "); for (i = 0; i < n; i++) { printf("%d ", arr[i]); } free(arr); break; case 4: printf("Enter the number of elements: "); scanf("%d", &n); arr = (int *) malloc(n * sizeof(int)); printf("Enter the elements: "); for (i = 0; i < n; i++) { scanf("%d", &arr[i]); } quick_sort(arr, 0, n - 1); printf("Sorted array: "); for (i = 0; i < n; i++) { printf("%d ", arr[i]); } free(arr); break; case 5: printf("Enter the number of elements: "); scanf("%d", &n); arr = (int *) malloc(n * sizeof(int)); printf("Enter the elements: "); for (i = 0; i < n; i++) { scanf("%d", &arr[i]); } selection_sort(arr, n); printf("Sorted array: "); for (i = 0; i < n; i++) { printf("%d ", arr[i]); } free(arr); break; case 6: printf("Enter the number of elements: "); scanf("%d", &n); arr = (int *) malloc(n * sizeof(int)); printf("Enter the elements: "); for (i = 0; i < n; i++) { scanf("%d", &arr[i]); } heap_sort(arr, n); printf("Sorted array: "); for (i = 0; i < n; i++) { printf("%d ", arr[i]); } free(arr); break; case 7: exit(0); default: printf("Invalid choice!\n"); } } return 0; } ``` 这是一个基于菜单的程序，可以选择要使用哪种排序算法。每个排序算法都有一个对应的函数实现。排序算法包括：直接插入排序、希尔排序、冒泡排序、快速排序、选择排序和堆排序。其中，排序算法的实现都是基于数组的。 在菜单中，用户需要输入要排序的元素数量和元素值。程序会对输入的元素进行排序，并输出排序后的结果。用户可以多次运行程序并尝试不同的排序算法。