C++ 实现冒泡排序与vector初始化方法

C++ 实现冒泡排序

#include<iostream>
#include<vector>
using namespace std;

void bubblesort(vector<int> &nums) {
	int i = 0, j = 0 , temp = 0;
	for (int i = 0; i < nums.size()-1; i++) {
		for (j = 0; j < nums.size() -1- i; j++) {
			if (nums[j] > nums[j + 1]) {
				temp = nums[j];
				nums[j] = nums[j + 1];
				nums[j+1] = temp;
			}
		}
	}
}

int main() {
	vector<int> arr = { 6,1,2,7,9,3,4,5,10,8 };            //vector初始化
	for (int i = 0; i < arr.size(); i++) {
		cout<<arr[i]<<endl;
	}
	bubblesort(arr);
	for (int i = 0; i < arr.size(); i++) {
		cout << arr[i] << endl;
	}
	return 0;
}

输出结果

6
1
2
7
9
3
4
5
10
8
1
2
3
4
5
6
7
8
9
10

vector初始化的几种方法

(1)     vector<int> arr = { 6,1,2,7,9,3,4,5,10,8 };
(2)     vector<int> list1(7,3);   //指定值初始化，list1被初始化为包含7个值为3的int
(3)     vector<int> l