用c语言写实现对数据的直接插入排序、折半插入排序，快速排序算法，写完整代码

当然可以，下面是C语言中实现三种排序算法的示例： 1. **直接插入排序**： ```c #include <stdio.h> void insertion_sort(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; } } // 主函数 int main() { int data[] = {5, 3, 8, 4, 2}; int size = sizeof(data) / sizeof(data[0]); printf("Before sorting:\n"); for (int i = 0; i < size; i++) { printf("%d ", data[i]); } insertion_sort(data, size); printf("\nAfter sorting with insertion sort:\n"); for (int i = 0; i < size; i++) { printf("%d ", data[i]); } return 0; } ``` 2. **折半插入排序**（也称为二分查找插入法，适用于部分有序的数据）： ```c #include <stdio.h> #include <stdlib.h> int binary_search(int arr[], int low, int high, int key) { if (high >= low) { int mid = low + (high - low) / 2; if (arr[mid] == key) return mid; if (arr[mid] > key) return binary_search(arr, low, mid - 1, key); else return binary_search(arr, mid + 1, high, key); } // Key not present in array return -1; } void half_insertion_sort(int arr[], int n) { for (int i = 1; i < n; ++i) { int key = arr[i]; int index = binary_search(arr, 0, i - 1, key); if (index != -1) { memmove(&arr[index + 1], &arr[index], (i - index) * sizeof(arr[0])); } arr[index] = key; } } // ... (主函数部分同上) ``` 3. **快速排序**： ```c #include <stdio.h> void swap(int* a, int* b) { int t = *a; *a = *b; *b = t; } int partition(int arr[], int low, int high) { int pivot = arr[high]; int i = (low - 1); for (int j = low; j <= high - 1; j++) { if (arr[j] < pivot) { i++; swap(&arr[i], &arr[j]); } } swap(&arr[i + 1], &arr[high]); 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); } } // ... (主函数部分同上) ```