cyxtest

用c语言写多种排序算法

注意空格
  #include <stdio.h>

  // 冒泡排序
  void bubbleSort(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 selectionSort(int arr[], int n) {
      int i, j, minIndex, temp;
      for (i = 0; i < n - 1; i++) {
          minIndex = i;
          for (j = i + 1; j < n; j++) {
              if (arr[j] < arr[minIndex]) {
                  minIndex = j;
              }
          }
          temp = arr[i];
          arr[i] = arr[minIndex];
          arr[minIndex] = temp;
      }
  }

  // 插入排序
  void insertionSort(int arr[], int n) {
      int i, j, key;
      for (i = 1; i < n; i++) {
          key = arr[i];
          j = i - 1;
          while (j >= 0 && arr[j] > key) {
              arr[j + 1] = arr[j];
              j--;
          }
          arr[j + 1] = key;
      }
  }

  // 希尔排序
  void shellSort(int arr[], int n) {
      int i, j, gap, 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 merge(int arr[], int l, int m, int r) {
      int i, j, k;
      int n1 = m - l + 1;
      int n2 = r - m;
      int L[n1], R[n2];
      for (i = 0; i < n1; i++) {
          L[i] = arr[l + i];
      }
      for (j = 0; j < n2; j++) {
          R[j] = arr[m + 1 + j];
      }
      i = 0;
      j = 0;
      k = l;
      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 l, int r) {
      if (l < r) {
          int m = l + (r - l) / 2;
          mergeSort(arr, l, m);
          mergeSort(arr, m + 1, r);
          merge(arr, l, m, r);
      }
  }

  // 快速排序
  int partition(int arr[], int low, int high) {
      int pivot = arr[high];
      int i = (low - 1);
      int j;
      for (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[] = {64, 34, 25, 12, 22, 11, 90};
      int n = sizeof(arr) / sizeof(arr[0]);
      quickSort(arr, 0, n - 1);
      printf("Sorted array: \n");
      for (int i = 0; i < n; i++) {
          printf("%d ", arr[i]);
      }
      return 0;
  }
supercyx3/cyxtest

cyxtest

用c语言写多种排序算法
