IT博客-数据结构与算法-最新评论http://www.cnitblog.com/kkxxlq/CommentsRSS.aspxzh-cnFri, 19 Aug 2005 07:30:15 GMTFri, 19 Aug 2005 07:30:15 GMTcnblogsre: 循环队列报数出队http://www.cnitblog.com/kkxxlq/archive/2009/12/14/2195.html#63138李青李青Mon, 14 Dec 2009 00:21:00 GMThttp://www.cnitblog.com/kkxxlq/archive/2009/12/14/2195.html#63138

李青 2009-12-14 08:21 发表评论
]]>re: 快排 qksorthttp://www.cnitblog.com/kkxxlq/archive/2007/06/02/2186.html#27919kkxxlqkkxxlqFri, 01 Jun 2007 23:10:00 GMThttp://www.cnitblog.com/kkxxlq/archive/2007/06/02/2186.html#27919program 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<num[mid] then search(x,a,mid);
if x=num[mid] then writeln('Found:',mid);
end;
end;

begin
write('Please input 10 numbers in order:');
for i:=1 to max do read(num);
write('Please input the number to search:');
readln(n);
search(n,1,max);
end.

kkxxlq 2007-06-02 07:10 发表评论
]]>re: 快排 qksorthttp://www.cnitblog.com/kkxxlq/archive/2007/05/27/2186.html#27661lalalalaSun, 27 May 2007 07:56:00 GMThttp://www.cnitblog.com/kkxxlq/archive/2007/05/27/2186.html#27661

lala 2007-05-27 15:56 发表评论
]]>re: 快排 qksorthttp://www.cnitblog.com/kkxxlq/archive/2007/05/27/2186.html#27660lalalalaSun, 27 May 2007 07:54:00 GMThttp://www.cnitblog.com/kkxxlq/archive/2007/05/27/2186.html#27660

lala 2007-05-27 15:54 发表评论
]]>re: 快排 qksorthttp://www.cnitblog.com/kkxxlq/archive/2006/07/05/2186.html#13270高韫之高韫之Wed, 05 Jul 2006 07:02:00 GMThttp://www.cnitblog.com/kkxxlq/archive/2006/07/05/2186.html#13270谢谢

高韫之 2006-07-05 15:02 发表评论
]]>