search_seq_2.cpp

来自「《数据结构》所有相关程序的算法。有图、数组以及二叉数的问题。附有程序及结果。」· C++ 代码 · 共 50 行

//Search_Seq.cpp
//This function is to find location of the inputed element in SSTbale
# include <malloc.h>
# include <iostream.h>

# include <conio.h>
# define MAX_LENGTH 100
typedef int KeyType;

typedef struct				//define structure SSTable
{   KeyType *elem;
    int length;
}SSTable;

int Search_Seq(SSTable ST,KeyType key)	//Search_Seq function
{   int mid,low=1,high=ST.length;
    while(low<=high)
    {  mid=(low+high)/2;
       if(key==ST.elem[mid])
	  return (mid);
       else if(key<ST.elem[mid])
		high=mid-1;
	    else
		low=mid+1;
    }
    return (0);
}

void main()  			   	//main() function
{  int i,key;
   SSTable ST;
   ST.elem=(KeyType *)malloc(sizeof(KeyType));
   cout<<endl<<endl<<"Search_Seq.cpp";
   cout<<endl<<"==============";
   cout<<endl<<endl<<"Please input the length of array (eg,5): ";
   cin>>ST.length;
   for(i=1;i<=ST.length;++i)
   {  cout<<"Please input the "<<i<<"th element (eg,58)   : ";
      cin>>ST.elem[i];
   }
   cout<<endl<<"The SSTable ST is : ";
   for(i=1;i<=ST.length;i++)
      cout<<ST.elem[i]<<"  ";		//output ST.elem[]
   cout<<endl<<endl<<"Please input the data to find : ";
   cin >>key;				//input the element to find
   cout<<"The location of "<<key<<" is (0 for none): ";
   cout<<Search_Seq(ST,key);		//call Search_Seq()
    cout<<endl<<endl<<"...OK!...";
   getch();
} //main() end