A538.冒泡排队 题解

#include<bits/stdc++.h>
using namespace std;

int main(){
    int n,a[205];
    cin>>n;
    for(int i = 0;i<n;i++){
        cin>>a[i];
    }
    for(int i = 0;i<n-1;i++){
        if(a[i]>a[i+1]) swap(a[i],a[i+1]);//一趟冒泡
    }
    for(int i = 0;i<n;i++){
        cout<<a[i]<<" ";
    }
    return 0;
}