冒泡法

#include<iostream>
using namespace std;
int main()
{
    int temp = 0;
    int arr[6] = { 0,3,1,7,4,5 };
    for (int i = 0; i < 5; i++) {
        for (int j = 0; j < 5 - i; j++) {
            if (arr[j + 1] > arr[j]) {
                temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
            }
        }
    }

    for (int i = 0; i < 6; i++) {
        cout << arr[i] << endl;
    }
    
    system("pause");
    return 0;
}