#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
using namespace std;
class solution {
public:
void bubbleSort(vector<int> &array) {
bool flag = 1;//判别之前那个序列是否有序
int nlength = array.size() - 1;
for (int i = 0; i <= nlength && flag; i++) {
flag = 0;
for (int j = nlength; j > i; j--) {
if (array[j] < array[j - 1]) {
flag = 1;
swap(array[j], array[j - 1]);
}
}
}
}
};
int main() {
solution solo;
vector<int> array = { 3,6,2,1,8,7,5,9 };
solo.bubbleSort(array);
for (auto i : array) {
cout << i << endl;
}
}
排序算法1: 冒泡排序(优化版) 排序
最新推荐文章于 2024-07-13 20:16:54 发布