#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define maxsize 100
typedef struct {
int data[maxsize];
int length;
}SqNode;
int FindEle(SqNode &L,int x){
int j=0;
for (; j < L.length; ++j) {
if (x<L.data[j]){
return j;
}
}
return j;
}
SqNode * InsertEle(SqNode &L, int data) {
int index;
index=FindEle(L,data);
for (int j = L.length-1; j >=index ; --j)
L.data[j+1]=L.data[j];
printf("%d\n",index);
L.data[index]=data;
++L.length;
}
int main(){
SqNode Node={
{0,2,3,4,5,6,7,8},
8
};
InsertEle(Node,10);
printf("%d\n",Node.length);
for (int i = 0; i < Node.length; ++i) {
printf("%d ",Node.data[i]);
}
}
顺序表有序插入数据
猜你喜欢
转载自www.cnblogs.com/szj666/p/13174326.html
今日推荐
周排行