一： 以下是使用C++编写的冒泡排序算法：
#include using namespace std;
void bubbleSort(int arr[], int size) { for (int i = 0; i < size - 1; i) { for (int j = 0; j < size - i - 1; j) { if (arr[j] > arr[j + 1]) { // 交换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 size = sizeof(arr) / sizeof(arr[0]);
复制cout << "排序前的数组："; for (int i = 0; i < size; i++) { cout << arr[i] << " "; } cout << endl;
bubbleSort(arr, size);
cout << "排序后的数组："; for (int i = 0; i < size; i++) { cout << arr[i] << " "; } cout << endl;
return 0; }
二：
#include using namespace std;
void bubbleSort(int arr[], int n) { for (int i 0; i < n-1;++) { for (int j = 0 j < n-i-1; j++) { if (arr[j] > arr[j+1]) { // 交换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 << "排序后的数组：\n"; for (int i = 0; i < n; i++) cout << arr[i] << " "; return 0; }