有序数列中插入一个数，使之仍有序

#define N 7void insert_sort(int key, int num[]){    int i = 0;    while(key > num[i] && i < N - 1)    {        i++;    }    for(int j = N - 2; j >= i; j--)    {        num[j + 1] = num[j];    }    num[i] = key;}int main(){    int num[N] ={2, 3, 5, 7, 8, 9};    insert_sort(6, num);    for(int i = 0; i < N; i++)    {        cout<<num[i]<<" ";    }    cout<<endl; //方法1//    for(auto n : num)//    {//        cout<<n<<" ";//    } 方法2    return 0;}