//冒泡排序
void bubbleSort(vector<int>& nums) {
int temp = 0;
for(int i = 0; i != nums.size() - 1; ++i) { //对于n个数要进行n - 1趟排序
for (int j = 0; j != nums.size() - i - 1; ++j) {
if (nums[j] > nums[j + 1]) {
temp = nums[j];
nums[j] = nums[j + 1];
nums[j + 1] = temp;
}
}
}
}
int main(int argc, char* argv[]) {
vector<int> ival;
int num = 0;
while (cin >> num) {
ival.push_back(num);
}
bubbleSort(ival);
for (auto i : ival) {
cout << i << endl;
}
return 0;
}
平均时间复杂度为:O(n2)
平均空间复杂度为:O(1)
稳定性:稳定