C语言实现归并排序、堆排序、快速排序和冒泡排序

1. 归并排序：

   #include <stdio.h>
   
   // 合并两个有序数组
   void merge(int arr[], int left, int middle, int right) {
       int i, j, k;
       int n1 = middle - left + 1;
       int n2 = right - middle;
   
       // 创建临时数组
       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[middle + 1 + j];
   
       // 合并临时数组到原数组
       i = 0;
       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++;
           }
           k++;
       }
   
       // 将剩余元素复制到原数组
       while (i < n1) {
           arr[k] = L[i];
           i++;
           k++;
       }
       while (j < n2) {
           arr[k] = R[j];
           j++;
           k++;
       }
   }
   
   // 归并排序
   void mergeSort(int arr[], int left, int right) {
       if (left < right) {
           int middle = left + (right - left) / 2;
   
           // 分割数组
           mergeSort(arr, left, middle);
           mergeSort(arr, middle + 1, right);
   
           // 合并有序数组
           merge(arr, left, middle, right);
       }
   }
   
   // 测试归并排序
   int main() {
       int arr[] = {12, 11, 13, 5, 6, 7};
       int n = sizeof(arr) / sizeof(arr[0]);
   
       printf("原始数组: ");
       for (int i = 0; i < n; i++)
           printf("%d ", arr[i]);
   
       mergeSort(arr, 0, n - 1);
   
       printf("\n排序后的数组: ");
       for (int i = 0; i < n; i++)
           printf("%d ", arr[i]);
   
       return 0;
   }
   

2. 堆排序：

   #include <stdio.h>
   
   // 构建最大堆
   void maxHeapify(int arr[], int n, int i) {
       int largest = i;
       int left = 2 * i + 1;
       int right = 2 * i + 2;
   
       // 如果左子节点比根节点大，则更新最大值索引
       if (left < n && arr[left] > arr[largest])
           largest = left;
   
       // 如果右子节点比当前最大值大，则更新最大值索引
       if (right < n && arr[right] > arr[largest])
           largest = right;
   
       // 如果最大值不是根节点，则交换根节点和最大值
       if (largest != i) {
           int temp = arr[i];
           arr[i] = arr[largest];
           arr[largest] = temp;
   
           // 递归调整子树
           maxHeapify(arr, n, largest);
       }
   }
   
   // 堆排序
   void heapSort(int arr[], int n) {
       // 构建最大堆
       for (int i = n / 2 - 1; i >= 0; i--)
           maxHeapify(arr, n, i);
   
       // 从中提取最大值，并调整堆
       for (int i = n - 1; i >= 0; i--) {
           int temp = arr[0];
           arr[0] = arr[i];
           arr[i] = temp;
   
           maxHeapify(arr, i, 0);
       }
   }
   
   // 测试堆排序
   int main() {
       int arr[] = {12, 11, 13, 5, 6, 7};
       int n = sizeof(arr) / sizeof(arr[0]);
   
       printf("原始数组: ");
       for (int i = 0; i < n; i++)
           printf("%d ", arr[i]);
   
       heapSort(arr, n);
   
       printf("\n排序后的数组: ");
       for (int i = 0; i < n; i++)
           printf("%d ", arr[i]);
   
       return 0;
   }
   

3. 快速排序：

   #include <stdio.h>
   
   // 分割数组并返回分割点索引
   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++;
               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);
       }
   }
   
   // 测试快速排序
   int main() {
       int arr[] = {12, 11, 13, 5, 6, 7};
       int n = sizeof(arr) / sizeof(arr[0]);
   
       printf("原始数组: ");
       for (int i = 0; i < n; i++)
           printf("%d ", arr[i]);
   
       quickSort(arr, 0, n - 1);
   
       printf("\n排序后的数组: ");
       for (int i = 0; i < n; i++)
           printf("%d ", arr[i]);
   
       return 0;
   }
   

4. 冒泡排序：

   #include <stdio.h>
   
   // 冒泡排序
   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 main() {
       int arr[] = {12, 11, 13, 5, 6, 7};
       int n = sizeof(arr) / sizeof(arr[0]);
   
       printf("原始数组: ");
       for (int i = 0; i < n; i++)
           printf("%d ", arr[i]);
   
       bubbleSort(arr, n);
   
       printf("\n排序后的数组: ");
       for (int i = 0; i < n; i++)
           printf("%d ", arr[i]);
   
       return 0;
   }