数据结构：顺序表的基本操作

#include<iostream>
using namespace std;
#define ElemType int
const int MaxSize=100;
typedef struct{
    ElemType data[MaxSize];
    int length=0;
}SqList; 

//插入
bool Insert(SqList &L,int idx,ElemType x){
    if(idx<1||idx>L.length+1)return false;
    if(L.length==MaxSize)return false;
    for(int k=L.length;k>=idx;k--){
        L.data[k]=L.data[k-1];
    }
    L.data[idx-1]=x;
    L.length++;
    return true;
} 
//删除
bool Delete(SqList &L,int idx,ElemType &x){
    if(idx<1||idx>L.length)return false;
    x=L.data[idx-1];
    for(int k=idx;k<L.length;k++){
        L.data[k-1]=L.data[k];
    }
    L.length--;
    return true;
} 
//二分查找 
int BinarySearch(SqList L,ElemType x){
    int low=0,high=L.length-1,mid;
    while(low<=high){
        mid=(low+high)/2;
        if(L.data[mid]==x)
            return mid;
        else if(L.data[mid]>x)
            high=mid-1;
        else
            low=mid+1;
    } 
    return -1;
}
int main(){
    SqList L;
    ElemType x;
    for(int i=1;i<=10;i++){
        cin>>x;
        Insert(L,i,x);
    }
    
    Delete(L,5,x);
    for(int i=0;i<L.length;i++){
        cout<<L.data[i]<<" "; 
    }
    cout<<endl;
    cout<<x<<endl;
    
//    int idx=BinarySearch(L,5);
//    cout<<idx<<endl;
    return 0;
}
//74 51 34 21 8 14 77 19 28 54
//1 2 3 4 5 6 7 8 9 10