二分查找算法的C语言实现

// 二分查找算法
int simpleSearch(int array[], int len, int value) {
int minIndex = 0, maxIndex = len;
int index = minIndex;
do {
if (array[index] == value) {
return index;
break;
} else if (value < array[index]) {
maxIndex = index;
} else if (value > array[index]) {
minIndex = index;
}
index = maxIndex - minIndex;
index = minIndex + index / 2 + index % 2;
} while (index < maxIndex);
return  -1;
}