冒泡排序bubble

#include <iostream>

using namespace std;

int main()
{
    int arr[] = {2, 5, 3, 4, 3, 4, 7, 9, 1, 10};
    int n = sizeof(arr) / sizeof(*arr);
    int temp;
    int i=0,j=0;

    for(i=0; i<n; i++)
    {
        for(j=n-2; j>=i; j--)
        {
            if(arr[j] > arr[j+1])
            {
                int temp = arr[j];
                arr[j] = arr[j+1];
                arr[j+1] = temp;
            }
        }
    }
    for(i=0; i<n; i++)
    {
        cout << arr[i] << " ";
    }
    cout << endl;


    return 0;
}