冒泡排序

#include <iostream>

using namespace std;

int main() {
    int arr[] = {11,2,4,6,4,8,93,4,4,56,77,1,8,89,9} ;

    int len = sizeof(arr) / sizeof(arr[0]);
    for (int i = 0; i < len - 1; ++i) {
        for (int j = i ; j < len - i - 1; ++j) {
            if(arr[j] > arr[j+1] ){
                int t = arr[j];
                arr[j] = arr[j+1];
                arr[j+1] = t;
            }
        }
    }

    for (int k = 0; k < len; ++k) {
        cout<< arr[k]<<endl;
    }

    return 0;
}