Bubble sort (concise version) (understand at a glance) (compared to selection sort)

Principle of Bubble Sort

Code:

#include<stdio.h>
void bubble(int* arr, int sz)//*arr可改成arr[10]/arr[]，本质还是传址
{
    int i = 0;
    for (i = 0; i < sz - 1; i++)
    {
        int j = 0;
        for (j = 0; j < sz - 1 - i; j++)//冒泡排序——j不断与j+1相比较，轮替进行
        {
            if (arr[j] > arr[j + 1])
            {
                int tmp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = tmp;
            }
        }
    }
}
    int main()
    {
        int arr[10] = { 10，9，8，7，6，5，4，3，2，1 };
        int sz = sizeof(arr) / sizeof(arr[0]);
        bubble(arr, sz);
        int i = 0;
        for (i = 0; i < sz; i++)
        {
            printf("%d ", arr[i]);
        }
        return 0;
    }

 Selection sort principle:

A number is compared with each subsequent digit.

#include<stdio.h>
void xuanze(int* arr, int sz)//*arr可改成arr[10]/arr[]，本质还是传址
{
    int i = 0;
    for (i = 0; i < sz - 1; i++)
    {
        int j = 0;
        for (j = i+1; j < sz - 1; j++)//i与每一个比他顺序后的数字比（j遍历）
        {
            if (arr[i] > arr[j])
            {
                int tmp = arr[i];
                arr[i] = arr[j];
                arr[j] = tmp;
            }
        }
    }
}
    int main()
    {
        int arr[10] = { 10，9，8，7，6，5，4，3，2，1};
        int sz = sizeof(arr) / sizeof(arr[0]);
        xuanze(arr, sz);
        int i = 0;
        for (i = 0; i < sz; i++)
        {
            printf("%d ", arr[i]);
        }
        return 0;
    }