冒泡排序

void test2()
{
    int array[10] = {10,34,232,23,345,1,343,65,768,97};
    
    for (int i = 0; i < 10; i++)
    {
        for (int j = 1; j < 10 - i; j++)
        {
            if (array[j - 1] > array[j])
            {
                int tmp = array[j - 1];
                
                array[j - 1] = array[j];
                
                array[j] = tmp;
            }
        }
    }
    
    for (int i = 0; i < 10; i++)
    {
        printf("%d\n",array[i]);
    }
}