C语言的排序算法有哪些？

C语言的排序算法有很多种，以下是一些常见的排序算法及其实现示例代码：

1. 冒泡排序（Bubble Sort）

   void bubbleSort(int arr[], int n) {
       int i, j;
       for (i = 0; i < n - 1; i++) {
           for (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;
               }
           }
       }
   }
   

2. 选择排序（Selection Sort）

   void selectionSort(int arr[], int n) {
       int i, j, minIndex;
       for (i = 0; i < n - 1; i++) {
           minIndex = i;
           for (j = i + 1; j < n; j++) {
               if (arr[j] < arr[minIndex]) {
                   minIndex = j;
               }
           }
           if (minIndex != i) {
               int temp = arr[i];
               arr[i] = arr[minIndex];
               arr[minIndex] = temp;
           }
       }
   }
   

3. 插入排序（Insertion Sort）

   void insertionSort(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;
       }
   }
   

4. 快速排序（Quick Sort）

   int partition(int arr[], int low, int high) {
       int pivot = arr[high];
       int i = low - 1;
       int j, temp;
       for (j = low; j < high; j++) {
           if (arr[j] < pivot) {
               i++;
               temp = arr[i];
               arr[i] = arr[j];
               arr[j] = temp;
           }
       }
       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);
       }
   }
   

5. 归并排序（Merge Sort）

   void merge(int arr[], int left, int mid, int right) {
       int i, j, k;
       int n1 = mid - left + 1;
       int n2 = right - mid;
       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[mid + 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 mid = left + (right - left) / 2;
           mergeSort(arr, left, mid);
           mergeSort(arr, mid + 1, right);
           merge(arr, left, mid, right);
       }
   }
   

6. 堆排序（Heap Sort）

   void heapify(int arr[], int n, int i) {
       int largest = i;
       int left = 2 * i + 1;
       int right = 2 * i + 2;
       int 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);
       }
   }
   
   void heapSort(int arr[], int n) {
       int i, temp;
       for (i = n / 2 - 1; 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);
       }
   }
   

以上是常见的一些C语言排序算法及其实现示例代码，每一种算法都有自己的特点和适用场景。