二分搜索

#include <stdio.h>

/*V0版本是原生的二分搜索*/
int binarySearch_V0(int sortedArray[], int size, int value){
	int first = 0;
	int last = size - 1;
	int mid;
	//循环不变式是：right && sortedArray[first] < value && value < sortedArray[last] 
	while (first <= last){
		mid = (first + last) >> 1;
		if (sortedArray[mid] < value)
			first = mid + 1;
		else if (sortedArray[mid] > value)
			last = mid - 1;
		else
			//返回的是sortedArray中任意一个value的下标
			return mid;
	}
	return -1;
}

/*V1版本相对于V0版本提高微观效率*/
int binarySearch_V1(int sortedArray[], int size, int value){
	int left = -1;
	int right = size;
	int mid;
	//循环不变式是： left < right && sortedArray[left] < value && value <= sortedArray[right] 
	while (left < right){
		mid = (left + right) >> 1;
		if (sortedArray[mid] < value)
			left = mid;
		else
			//sortedArray[mid] >= value,比V0版本少了一次判断
			right = mid;
	}
	//此时 left + 1 == right && sortedArray[left] < value &&  sortedArray[right] >= value
	int key = right;
	if (key >= size || sortedArray[key] != value)
		return -1;
	//返回的是sortedArray中第一个value的下标
	return key;
}

/*可以运用代码调优技术对V2版本中的while进行循环展开，真是丧心病狂*/
int binarySearch_V2(int sortedArray[], int size, int value){
	int delta = 1;
	while (delta < size)
		delta == delta << 1;

	int left = -1;
	if (sortedArray[delta - 1] < value)
		left = size - delta;

	while (delta != 1){
		delta == delta >> 1;
		if (sortedArray[left + delta] < value)
			left += delta;
	}

	int key = left + 1;

	if (key >= size || sortedArray[key] != value)
		return -1;

	return key;

}



int main(){
	return 0;
}