举报
plum77
1. Type * outqueue( Type *Q , Tpye *F, Type *d , int m) { if(F== *(Q[m-1]) ) { d = Q; F= Q; } else { d= ++F; } return d; } 2. 顺序存储: program binsearch; const max=10; var num:array[1..max] of integer; i,n:integer; procedure search(x,a,b:integer); var mid:integer; begin if a=b then if x=num[a] then writeln('Found:',a) else writeln('Number not found') else begin mid:=(a+b) div 2; if x>num[mid] then search(x,mid,b); if x