C++实现冒泡排序

C++实现冒泡排序

#include <iostream>
using namespace std;


int main()
{
    int arr[5] = {300,456,234,567,123};
    int temp = 0;
    int arr_length = sizeof(arr) / sizeof(arr[0]);
    for(int i = 0; i < arr_length - 1; i++){
        for(int j = 0; j < arr_length - i - 1; j++){
            if(arr[j + 1] < arr[j]){
                temp = arr[j + 1];
                arr[j + 1] = arr[j];
                arr[j] = temp;
            }
        }
    }


    for(int j = 0; j < arr_length; j++){
        cout << arr [j] << endl;
    }
    return 0;
}