冒泡法排序

#include<iostream>
using namespace std;
void bubblesort(int *arr,int n) {
    bool sorted = false;
    int temp = 0;
    while (!sorted) {
        sorted = true;
        for (int i =1; i < n; i++) {
            if (arr[i - 1] > arr[i]) {
                temp = arr[i - 1];
                arr[i - 1] = arr[i];
                arr[i] = temp;
                sorted = false;
            }
        }
        n--;
    }
}
int main() {
    int arr[10] = { 1,2,3,7,3,4,5,1,6,3 };
    bubblesort(arr, 10);
    for (int i = 0; i < 10; i++) {
        cout << arr[i] << "    ";
    }
    return 0;
}