冒泡排序实现

时间复杂度O(n^2)

#include <iostream>

void bubbleSort(int *arr, int len)
{
    for (int i = 0; i < len - 1; ++i) // n个数只需要比较n-1趟
    {
        for (int j = 0; j < len - 1 - i; ++j) // 每一趟只需要比较n-1-i次
        {
            if (arr[j] > arr[j+1])
            {
                int temp = arr[j];
                arr[j] = arr[j+1];
                arr[j+1] = temp;
            }
        }
    }
}

int main()
{
    int arr[10] = {10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
    for(auto i: arr) {
        std::cout << i << " ";
    }
    std::cout << std::endl;
    bubbleSort(arr, 10);
    for (auto i: arr) {
        std::cout << i << " ";
    }
    std::cout << std::endl;
    return 0;
}