設順序表va中的數據元素遞增有序。試寫一算法，將x插入到順序表的適當位置上，以保持該表的有序性

#include<stdio.h>
#include<iostream>
using namespace std;
#define max_size 20
typedef int Status;
typedef int Element;
typedef struct
{
    /* data */
    Element elem[max_size];
    int listsize = max_size;
    int length;
}Sqlist;

Sqlist addElem(){
    Sqlist va;
    for(int i=0;i<10;i++){
        va.elem[i] = i;
        va.length++;
    }
        return va;
}

bool InsertOrder(Sqlist va,Element x){
    if(va.length>=va.listsize)
        return -1;
    int i;
    for(i=va.length;i>=0,va.elem[i]>=x;i--)
            va.elem[i] = va.elem[i-1];
    va.elem[i] = x;
    va.length++;
    for(int k=0;k<=va.length;k++)
        cout<<va.elem[k]<<" ";
    return 1;
}

//嚴奶奶課後習題
int main(){
    Element x = 0;
    Sqlist va = addElem();
    InsertOrder(va,x);

}