c++冒泡排序

冒泡排序

#include <iostream>

using namespace std;

int main()
{
    int a[]={ 16,2,18,200,19};
    int aLenght=sizeof(a)/sizeof(int);
    for(int i=0;i<aLenght-1;i++){
        if(a[i]>a[i+1]){
            int aMax = a[i];
            a[i]=a[i+1];
            a[i+1]=aMax;
        }
    }
    for(int i=0;i<aLenght;i++){

         cout << a[i] << endl;
    }
    return 0;
}