元素按值非递减有序排列,设计一个…

#include<stdio.h>
#define N 10

typedef struct
{
    int data[N];
    int top;
}decrease;


decrease *initdecrease()
{
    decrease *s;
    s=malloc(sizeof(decrease));
    s->top=-1;
    return s;
}

decrease * pushdecrease(decrease *s)
{
    printf("请输入有序的数字(输入为-1结束)：\n");
    do {
        s->top++;
        scanf("%d",&s->data[s->top]);
        if(s->top==N-1){
            printf("数据个数已到最多！！\n");
            return s;
        }
    } while (s->data[s->top]!=-1);
    return s;
}

decrease * insertdecrease(decrease *s,int x)
{
    int i=0,j;
    while(itop&&s->data[i]
        i++;
    for(j=s->top-1;j>=i;j--)
        s->data[j+1]=s->data[j];
    s->data[i]=x;
    s->top++;
    return s;
}

void popdecrease(decrease *s)
{
    for(int i=0;i<top;i++)
        printf("%d   ",s->data[i]);
    printf("\n");
}

int main ()
{
    decrease *s;
    int x;
    s=initdecrease();
    s=pushdecrease(s);
    printf("输入结果为：");
    popdecrease(s);
    printf("请输入要插入的数：");
    scanf("%d",&x);
    s=insertdecrease(s,x);
    printf("插入结果为：");
    popdecrease(s);
    return 0;
}