经典算法冒泡排序

下面给数组进行冒泡排序

#include <iostream>
using namespace std;
int main() {
	//数组排列为4,2,8,0,5,7,1,3,9
	int arr[] = { 4,2,8,0,5,7,1,3,9 };
	cout << "排序前：" << endl;
	for (int e = 0;e < 9;e++) {
		cout << arr[e] << " ";
	}
	cout << endl;

	//比较相邻元素大小，如果大的就交换位置排到前面
	int temp = 0;
	for (int k = 0;k < 8;k++) {
		for (int i = 0;i < 8 - k;i++) {
			if (arr[i] > arr[i + 1]) {
				temp = arr[i + 1];
				arr[i + 1] = arr[i];
				arr[i] = temp;
			}
		}
	}
	//输出排序后的结果
	cout << "排序后：" << endl;
	for (int j = 0;j < 9;j++) {
		cout << arr[j] << " ";
	}
	return 0;
}