#include
     
      #define MaxSize 50typedef struct LNode{    int data[MaxSize];    int length;}LNode;//初始化顺序表void init(LNode &L){    L.length = 0;} //构建顺序表void create(LNode &L){    init(L);    int x;    scanf("%d",&x);     while(x!=-1&&L.length
      
       x){                high = mid -1;            }else{                low = mid + 1;            }        }     }        return -1;} //替换元素int exchange1(LNode &L){    int index =  binSearch(L,3);    if(index == -1){        return -1;    }else{        int temp = L.data[index];        L.data[index] = L.data[index + 1];        L.data[index + 1] = temp;        return 1;    }} int main(){    LNode L;    create(L);    exchange1(L);    show(L);    return 0;}
      
     

运行结果：