C++中有许多排序算法可以应用，以下是几种常见的排序算法及其应用示例：
冒泡排序：通过依次比较相邻元素并交换顺序，将最大或最小的元素逐渐“冒泡”到数组的一端。#include <iostream>using namespace std;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[] = {64, 34, 25, 12, 22, 11, 90};int n = sizeof(arr)/sizeof(arr[0]);bubbleSort(arr, n);cout << "排序后的数组：";for (int i = 0; i < n; i++) {cout << arr[i] << " ";}return 0;}#include <iostream>using namespace std;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 = j - 1;}arr[j+1] = key;}}int main() {int arr[] = {64, 34, 25, 12, 22, 11, 90};int n = sizeof(arr)/sizeof(arr[0]);insertionSort(arr, n);cout << "排序后的数组：";for (int i = 0; i < n; i++) {cout << arr[i] << " ";}return 0;}#include <iostream>using namespace std;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[] = {64, 34, 25, 12, 22, 11, 90};int n = sizeof(arr)/sizeof(arr[0]);quickSort(arr, 0, n-1);cout << "排序后的数组：";for (int i = 0; i < n; i++) {cout << arr[i] << " ";}return 0;}这只是几种排序算法的简单示例，实际应用中可能需要根据具体情况选择合适的算法，并进行适当的优化。
