C语言冒泡排序

#include<stdio.h>
#include<stdlib.h>

int main() {

    int arr[10] = { 2,4,5,6,7,8,1,5,6,7 };
    int len = sizeof(arr) / sizeof(arr[0]);
    printf("原始数组：\n");
    for (size_t i = 0; i < len; i++)
    {
        printf("%d ", arr[i]);
    }
    printf("\n长度是：%d\n", len);

    int temp = 0;
    for (size_t i = 0; i < (len - 1); i++) //外层控制行
    {
        for (size_t j = 0; j < (len-1-i); j++) //内层控制列
        {
            if (arr[j] > arr[j + 1]) {
                temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
            }
        }
    }

    printf("\n排序后数组：\n");
    for (size_t i = 0; i < len; i++)
    {
        printf("%d ", arr[i]);
    }
    

    printf("\n");
    system("pause");
    return EXIT_SUCCESS;
}