C++伪代码：直接插入排序和希尔排序,起泡排序和快速排序,简单选择排序和堆排序,二路归并排序算法（递归和非递归）

当然，以下是几种常见排序算法的C++伪代码： 1. **直接插入排序** (Insertion Sort): ```cpp 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; } } ``` 2. **希尔排序** (Shell Sort): ```cpp void shellSort(int arr[], int n) { // Start with a big gap, then reduce the gap for (gap = n/2; gap > 0; gap /= 2) { // Do a gapped insertion sort for this gap size. // The first gap elements a[0..gap-1] are already in gapped order keep adding one more element until the entire array is gap sorted for (i = gap; i < n; i += 1) { int temp = arr[i]; int j = i; while (j >= gap && arr[j-gap] > temp) { arr[j] = arr[j-gap]; j -= gap; } arr[j] = temp; } } } ``` 3. **冒泡排序** (Bubble Sort): ```cpp 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]) { swap(arr[j], arr[j + 1]); } } } } ``` 4. **快速排序** (Quick Sort): ```cpp void quickSort(int arr[], int low, int high) { if (low < high) { int pivotIndex = partition(arr, low, high); quickSort(arr, low, pivotIndex - 1); quickSort(arr, pivotIndex + 1, high); } } // Partition function for quicksort 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); } ``` 5. **简单选择排序** (Selection Sort): ```cpp void selectionSort(int arr[], int n) { for (int i = 0; i < n - 1; i++) { int min_idx = i; for (int j = i + 1; j < n; j++) if (arr[j] < arr[min_idx]) min_idx = j; swap(arr[i], arr[min_idx]); } } ``` 6. **堆排序** (Heap Sort): ```cpp void heapify(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) { swap(arr[i], arr[largest]); heapify(arr, n, largest); } } void heapSort(int arr[], int n) { for (int i = n / 2 - 1; i >= 0; i--) heapify(arr, n, i); for (int i=n-1; i>=0; i--) { swap(arr[0], arr[i]); heapify(arr, i, 0); } } ``` 7. **二路归并排序** (Merge Sort, both recursive and iterative versions omitted due to complexity, but you can find these implementations online easily): - 对于递归版本，你可以搜索"二分归并排序C++递归实现"。 - 对于非递归版本，即使用栈模拟递归过程，通常会涉及到辅助数组和下标更新。