数据结构——折半查找源代码

<<"--- 6. 退出 ------------------------- -----\n";

do

{ cout<<"请选择操作:";

cin>>choice;

switch(choice)

{

case 1://

cout<<"输入静态查找表的长度"<<endl; cin>>n;

a.Create(n);

break;

case 2://

cout<<"请输入查找关键字："<<endl; cin>>key;

a.SeSearch(key);

break;

case 3:

a.Ascendsort();

cout<<"输入查找关键字："<<endl;

cin>>key;

k=a.BiSearch_2(key);

if(k==-1)

cout<<"末找到!"<<endl;

else

cout<<"找到!位居第"<<k+1<<endl; break;

case 4:

a.Ascendsort();

cout<<"输入查找关键字："<<endl; cin>>key;

a.BiSearch_1(key);

break;

case 5:

a.Display();

break;

case 6:

cout<<"运行结束"<<endl;

break;

default:

cout<<"输入代码非法，应在0--7之间"<<endl; cout<<"请继续选择操作";

break;

}//switch