#include<iostream>
using namespace std;
#define Max 10
struct Xian
{
int data[Max];
int length;
}Sqlist;
int main()
{
int i,j=0,n;
cin>>Sqlist.length;
for(i=0;i<Sqlist.length;i++)
{
Sqlist.data[i]=i;
cout<<Sqlist.data[i]<<" ";
}
cout<<endl;
cin>>n;
while(j<Sqlist.length&&Sqlist.data[j]<n)
j++;
for(i=Sqlist.length-1;i>=j;i--)
Sqlist.data[i+1]=Sqlist.data[i];
Sqlist.data[i+1]=n;
Sqlist.length++;
for(j=0;j<Sqlist.length;j++)
cout<<Sqlist.data[j]<<" ";
cout<<endl;
return 0;
}
实现插入一个元素,时间复杂度为O(n).
线性表顺序表插入操作题
最新推荐文章于 2023-01-07 17:41:56 发布