使用c语言随机生成10个整型数，分别使用直接插入排序、折半插入排序、希尔排序、冒泡排序、快速排序、选择排序算法，将其排序

好的，下面是一个使用C语言随机生成10个整型数，并分别使用直接插入排序、折半插入排序、希尔排序、冒泡排序、快速排序、选择排序算法进行排序的示例代码。 ```c #include <stdio.h> #include <stdlib.h> #include <time.h> #define SIZE 10 // 直接插入排序 void insertionSort(int arr[], int n) { for (int i = 1; i < n; i++) { int key = arr[i]; int j = i - 1; while (j >= 0 && arr[j] > key) { arr[j + 1] = arr[j]; j--; } arr[j + 1] = key; } } // 折半插入排序 void binaryInsertionSort(int arr[], int n) { for (int i = 1; i < n; i++) { int key = arr[i]; int left = 0; int right = i - 1; while (left <= right) { int mid = left + (right - left) / 2; if (arr[mid] > key) { right = mid - 1; } else { left = mid + 1; } } for (int j = i - 1; j >= left; j--) { arr[j + 1] = arr[j]; } arr[left] = key; } } // 希尔排序 void shellSort(int arr[], int n) { for (int gap = n / 2; gap > 0; gap /= 2) { for (int i = gap; i < n; i++) { int temp = arr[i]; int j; for (j = i; j >= gap && arr[j - gap] > temp; j -= gap) { arr[j] = arr[j - gap]; } arr[j] = temp; } } } // 冒泡排序 void bubbleSort(int arr[], int n) { for (int i = 0; i < n - 1; i++) { for (int j = 0; j < n - i - 1; j++) { if (arr[j] > arr[j + 1]) { int temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = 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++; int temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; } } int temp = arr[i + 1]; arr[i + 1] = arr[high]; arr[high] = temp; return i + 1; } void quickSort(int arr[], int low, int high) { if (low < high) { int pi = partition(arr, low, high); quickSort(arr, low, pi - 1); quickSort(arr, pi + 1, high); } } // 选择排序 void selectionSort(int arr[], int n) { for (int i = 0; i < n - 1; i++) { int minIndex = i; for (int j = i + 1; j < n; j++) { if (arr[j] < arr[minIndex]) { minIndex = j; } } int temp = arr[minIndex]; arr[minIndex] = arr[i]; arr[i] = temp; } } int main() { int arr[SIZE]; srand(time(0)); printf("随机生成的10个整型数：\n"); for (int i = 0; i < SIZE; i++) { arr[i] = rand() % 100; printf("%d ", arr[i]); } printf("\n"); int arrCopy[SIZE]; for (int i = 0; i < SIZE; i++) { arrCopy[i] = arr[i]; } insertionSort(arrCopy, SIZE); printf("直接插入排序结果：\n"); for (int i = 0; i < SIZE; i++) { printf("%d ", arrCopy[i]); } printf("\n"); for (int i = 0; i < SIZE; i++) { arrCopy[i] = arr[i]; } binaryInsertionSort(arrCopy, SIZE); printf("折半插入排序结果：\n"); for (int i = 0; i < SIZE; i++) { printf("%d ", arrCopy[i]); } printf("\n"); for (int i = 0; i < SIZE; i++) { arrCopy[i] = arr[i]; } shellSort(arrCopy, SIZE); printf("希尔排序结果：\n"); for (int i = 0; i < SIZE; i++) { printf("%d ", arrCopy[i]); } printf("\n"); for (int i = 0; i < SIZE; i++) { arrCopy[i] = arr[i]; } bubbleSort(arrCopy, SIZE); printf("冒泡排序结果：\n"); for (int i = 0; i < SIZE; i++) { printf("%d ", arrCopy[i]); } printf("\n"); for (int i = 0; i < SIZE; i++) { arrCopy[i] = arr[i]; } quickSort(arrCopy, 0, SIZE - 1); printf("快速排序结果：\n"); for (int i = 0; i < SIZE; i++) { printf("%d ", arrCopy[i]); } printf("\n"); for (int i = 0; i < SIZE; i++) { arrCopy[i] = arr[i]; } selectionSort(arrCopy, SIZE); printf("选择排序结果：\n"); for (int i = 0; i < SIZE; i++) { printf("%d ", arrCopy[i]); } printf("\n"); return 0; } ```