线性表的查找

#include<iostream>
using namespace std;
typedef int keytype;
typedef struct
{
	keytype key;
}elemtype;
typedef struct
{
	elemtype* s;
	int length;
}st;
int search_seq(st t, keytype k)//设置监视哨的顺序查找
{
	int i = 0;
	t.s[0].key = k;
	for ( i = t.length;t.s[i].key != k;i--)
	{
		;
	}
	return i;
}
int search_bin(st t, keytype k)//二分查找非递归算法
{
	int low = 1, high = t.length;
	while (low <= high)
	{
		int mid = (low + high) / 2;
		if (t.s[mid].key == k)
		{
			return mid;
		}
		else if (k<t.s[mid].key)
		{
			high = mid - 1;
		}
		else
		{
			low = mid + 1;
		}
	}
	return 0;
}


int main()
{
	return 0;
}