C++中有許多排序算法可以應用，以下是幾種常見的排序算法及其應用示例：

1. 冒泡排序：通過依次比較相鄰元素并交換順序，將最大或最小的元素逐漸“冒泡”到數組的一端。

#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;
}

2. 插入排序：將待排序的元素從未排序序列中逐個插入到已排序序列中的正確位置。

#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;
}

3. 快速排序：選擇一個基準元素，將小于基準的元素放在左邊，大于基準的元素放在右邊，然后遞歸地對左右兩個子數組進行排序。

#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;
}

這只是幾種排序算法的簡單示例，實際應用中可能需要根據具體情況選擇合適的算法，并進行適當的優化。