seqssearch2.cpp

包含各种测试,查找和算法等代码,如冒泡算法,树的遍历,链表,队列,堆栈等

#include <iostream.h>
#include "datatype.h"

int SeqSSeach2(datatype a[], int n, keytype key)
//在有序表a[0]--a[n-1]中顺序查找关键码为key的对象
//查找成功时返回该对象的下标序号；失败时返回-1
{
   int i = 0;
   a[n].key = key;						//a[n]为监视哨
   while(a[i].key < key) i++;

   if(a[i].key == key) return i;
   else return -1;
}

void main(void)
{
	datatype Test[11] = {2,3,5,7,9,11,13,15,17,20};
	int n = 10, key = 11, i;

	if((i = SeqSSeach2(Test, n, key)) != -1)
		cout << "查找成功! 该对象为第" << i << "个对象";
	else  cout << "查找失败! 该对象在对象集合中不存在";
}