编辑代码

#include <stdio.h>

int binarySearch(int searchKey, int array[], int arrLen) {
	int low = 0;
	int high = arrLen - 1;
	int keyPos = -1;
	
	while (low <= high) {
		int mid = low + ((high - low) >> 1);
		if (searchKey > array[mid]) {
			low = mid++;
		} else if (searchKey < array[mid]) {
			high = mid--;
		} else {
			keyPos = mid;
			break;
		}
	}
	
	return keyPos;
}

int main() {
	int array[] = {1, 2, 3, 4, 5};
	printf("%d\n", binarySearch(4, array, 5));
	int i = 0;
	for (; i<5; i++) printf("%d ", array[i]);
	
	return 0;
}