C++项目-冒泡排序

将一个数组从小到大排序

#include <iostream>
using namespace std;

int main() {
	
	int arr[] = { 3,5,21,6.9,2,45,2,6 };
	int size = sizeof(arr) / sizeof(arr[0]);
	
	//排序前
	cout << "排序前：" << endl;
	for (int i = 0; i < size; i++) {
		cout << arr[i] << " ";
		
	}
	cout << endl;

	//冒泡排序
	for (int i = 0; i < size - 1; i++) {					//排序轮数
		for (int j = 0; j < size - i - 1; j++) {			//每轮排几次
			if (arr[j] > arr[j + 1]) {
				int temp = arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = temp;
			}
		}
	}

	//排序后
	cout << "排序后：" << endl;
	for (int i = 0; i < size; i++) {
		cout << arr[i] << " ";

	}
	cout << endl;
	
	
	system("pause");
	return 0;
}