时间复杂度：O(n2)

稳定排序


void bubbleSort(int a[], int size)

{

    bool sorted = false;

    

    for (int i = 0; i < size; ++i)

    {

        sorted = true;

        for (int j = 0; j < size - i - 1; ++j)

        {

            if (a[j] > a[j + 1])

            {

                swap(a[j], a[j + 1]);

                sorted = false;

            }

        }


        if (sorted)

        {

            break;

        }

    }

}