C++涓湁璁稿鎺掑簭绠楁硶鍙互搴旂敤锛屼互涓嬫槸鍑犵甯歌鐨勬帓搴忕畻娉曞強鍏跺簲鐢ㄧず渚嬶細

1. 鍐掓场鎺掑簭锛氶€氳繃渚濇姣旇緝鐩搁偦鍏冪礌骞朵氦鎹㈤『搴忥紝灏嗘渶澶ф垨鏈€灏忕殑鍏冪礌閫愭笎鈥滃啋娉♀€濆埌鏁扮粍鐨勪竴绔€?/li>

#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 << "鎺掑簭鍚庣殑鏁扮粍锛?quot;;
for (int i = 0; i < n; i++) {
cout << arr[i] << " ";
}
return 0;
}

2. 鎻掑叆鎺掑簭锛氬皢寰呮帓搴忕殑鍏冪礌浠庢湭鎺掑簭搴忓垪涓€愪釜鎻掑叆鍒板凡鎺掑簭搴忓垪涓殑姝ｇ‘浣嶇疆銆?/li>

#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 << "鎺掑簭鍚庣殑鏁扮粍锛?quot;;
for (int i = 0; i < n; i++) {
cout << arr[i] << " ";
}
return 0;
}

3. 蹇€熸帓搴忥細閫夋嫨涓€涓熀鍑嗗厓绱狅紝灏嗗皬浜庡熀鍑嗙殑鍏冪礌鏀惧湪宸﹁竟锛屽ぇ浜庡熀鍑嗙殑鍏冪礌鏀惧湪鍙宠竟锛岀劧鍚庨€掑綊鍦板宸﹀彸涓や釜瀛愭暟缁勮繘琛屾帓搴忋€?/li>

#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 << "鎺掑簭鍚庣殑鏁扮粍锛?quot;;
for (int i = 0; i < n; i++) {
cout << arr[i] << " ";
}
return 0;
}

杩欏彧鏄嚑绉嶆帓搴忕畻娉曠殑绠€鍗曠ず渚嬶紝瀹為檯搴旂敤涓彲鑳介渶瑕佹牴鎹叿浣撴儏鍐甸€夋嫨鍚堥€傜殑绠楁硶锛屽苟杩涜閫傚綋鐨勪紭鍖栥€?/p>