递归查找数,数据以排序。
用递归实现二分查找。
var
x,y,i,j,k,n,m,l:longint;a:array[1..100]of longint;
procedure jc(x,y:longint);
var
i,j,k:longint;
begin
k:=(x+y) div 2;
if a[k]=m then writeln('then num in ',k:5);
if x>y then
begin
writeln(' ???_no found_??? ');
writeln(' Are you kidding me???');
end else
begin
if a[k]<m then jc(k+1,y);
if a[k]>m then jc(x,k-1);
end;
end;
procedure init;
var
i:longint;
begin
readln(n);
for i:=1 to n do
begin
read(a[i]);
end;
readln(m);
end;
begin
init;
x:=1;
y:=n;
jc(x,y);
readln;
end.