折半查找

#include <iostream>
#include <malloc.h>

using namespace std;

#define MAXL 100
typedef int KeyType;
typedef char InfoType;

typedef struct {
	KeyType key;//关键字
	InfoType data;//其他数据项
}RecType;

void CreateList(RecType R[], KeyType keys[], int n) {//创建顺序表
	for (int i = 0; i < n; i++) {
		R[i].key = keys[i];
	}
}

void DispList(RecType R[], int n) {//输出顺序表
	for (int i = 0; i < n; i++) {
		cout << R[i].key << " ";
	}
	cout << endl;
}


int BinSearch(RecType R[], int n, KeyType k) {
	int low = 0, high = n - 1, mid, cout = 0;
	while (low <= high) {
		mid = (low + high) / 2;
		printf("第%d次比较：在[%d,%d]中比较元素R[%d]:%d\n", ++cout, low, high, mid, R[mid].key);

		if (R[mid].key == k)
			return mid + 1;
		if (R[mid].key > k) {
			high = mid - 1;
		}
		else {
			low = mid + 1;
		}
	}
	return 0;
}

int main() {
	RecType R[MAXL];
	int n = 10, i;
	KeyType k = 9;
	int a[] = { 1,2,3,4,5,6,7,8,9,10 };
	CreateList(R, a, n);
	cout << "关键字序列：";
	DispList(R, n);
	cout << "查找" << k << "所比较的关键字:" << endl;

	if ((i = BinSearch(R, n, k)) != 0)
		cout << "\n元素" << k << "的位置是" << i << endl;
	else
		cout << "\n元素" << k << "不在表中" << endl;

	return 1;
}