折半查找C++实现

#include<iostream>
using namespace std;

int binSearch(int *list, int key, int n) { //key表示需要查找的元素    n表示数组的大小
	int low, mid, high;
	low = 0;
	high = n-1;
	while(low <= high) {
		mid = (low + high)/2;
		
		if(key < list[mid]) {
			high = mid - 1;
		}
		else if(key > list[mid]) {
			low = mid + 1;
		}
		else
			return mid;
	}
	return -1;
}

int main() {
	int list[10] = {1,3,6,12,15,19,25,32,38,87};
	int result = binSearch(list, 32, 10);
	cout <<"The result is " << result <<endl;
	return 0;
}