一个无聊的递归冒泡排序程序

#include<cstdio>
#include<cstdlib>
#include<iostream>
#define Length 6
using namespace std;
 void sortay(int sz[], int i)
        {
            if (i == Length) return;

            int midint;
            for (int j = Length - 1; j > i; j--)
            {
               
                if (sz[j] > sz[j - 1]) //小于号为从小到大，反之为从大到小
                {

                    midint = sz[j];
                    sz[j] = sz[j - 1];
                    sz[j - 1] = midint;
                }
            }

            sortay(sz, i + 1);
        }
   
          

int main()
{
  int ay[] ={ 3, 39, 19, 14, 0, 7 };
     sortay(ay, 0);
     for (int i=0;i<6;i++)
      printf("%d ",ay[i]);
     return 0;
}