データ構造実験(三)——線形表の検索

#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<