冒泡排序

int array[] = {8,12,12,6,9,5};
    for (int i = 0; i < 6; i++) 
    {
          for (int j = 0; j < 6 - i - 1; j++) 
          {
                if (array[j] < array[j + 1]) 
                {
                      int num= array[j];
                      array[j] = array[j + 1];
                      array[j + 1] = num;
                }
          }
    }    

发现个更好的博主做的很棒的解释：
https://zxfdog.blog.csdn.net/article/details/113823891