冒泡排序代码实现

#include
using namespace std;

const int BUFFSIZE = 10;
int Bubble_Sort(int Arr[]);
int main()
{
    int Arr[BUFFSIZE] = { 88,1,59,105,9,2,8,15,6,10 };  // 待排序元素
    Bubble_Sort(Arr) //排序
    return 0;
}

int Bubble_Sort(int Arr[])
{
    int Counts = BUFFSIZE - 1; // 排序总轮数
    for (int i = 0; i < Counts; i++)
    {
        for (int j = 0; j < Counts - i; j++) 
        {
            if (Arr[j] > Arr[j + 1])
            {
                int tmp = Arr[j + 1];
                Arr[j + 1] = Arr[j];
                Arr[j] = tmp;
            }
        }
        //每一轮排序后输出元素顺序
        for (int i = 0; i < BUFFSIZE; i++)
        {
            cout << Arr[i] << " ";
        }
        cout << endl;
    }

    return 0;
}