C++实现数据结构中的折半查找法举例

//二分查找的C++实现
#include "stdafx.h"
#include <iostream>
using namespace std;
#define MAXL 100
typedef int KeyType;
typedef char InfoType[10];
typedef struct
{
KeyType key;                //KeyType为关键字的数据类型
InfoType data;              //其他数据
} NodeType;
typedef NodeType SeqList[MAXL];     //顺序表类型


int BinSearch(SeqList R, int n, KeyType k)
{
int low = 0, high = n - 1, mid;
while (low <= high)
{
mid = (low + high) / 2;
if (R[mid].key == k)      //查找成功返回
return mid + 1;
if (R[mid].key>k)       //继续在R[low..mid-1]中查找
high = mid - 1;
else
low = mid + 1;          //继续在R[mid+1..high]中查找
}
return 0;
}


int main()
{
int i, n = 10;
int result;
SeqList R;
KeyType a[] = { 1,3,9,12,32,41,45,62,75,77 }, x = 75;
for (i = 0; i<n; i++)
R[i].key = a[i];
result = BinSearch(R, n, x);
if (result>0)
printf("序列中第 %d 个是 %d\n", result, x);
else
printf("木有找到！\n");
while(2)
{


}
return 0;
}