数据结构实验（三）——线性表的查找

线性表的查找

1.线性表的顺序查找与二分法查找

#include 
using namespace std;
#define MAXL 20
typedef int KeyType;
typedef int InfoType;
typedef struct 
{
	KeyType key;
	InfoType data;
}NodeType;
typedef NodeType SeqList[MAXL];//顺序表类
int SeqSearch(SeqList R,int n,KeyType k)
{
	int i=0;
	while(i=n)
	{
		cout<<"查找失败"<k)
		{
			high=mid-1;
			cout<<"查找范围为："<