冒泡排序算法

void function(int arr[],int len)
{
    for (int i = 0; i < len; ++i) {
        for (int j =0; j < len - i- 1; ++j) {
            if (arr[j] > arr[j + 1]){
                int tmp = arr[j ];
                arr[j ] = arr[j + 1];
                arr[j + 1] = tmp;
            }
        }
    }
    for (int n = 0; n < len; ++n) {
        printf("%d\n", arr[n]);
    }
}