主要实现了递归和循环两种实现方式;
#include<stdio.h>
int recursive(int input, int *src, int low, int high) {
int mid = (high + low) / 2;
if (high >= low) {
if (input > src[mid]) {
recursive(input, src, mid + 1, high);
}
else if (input < src[mid]) {
recursive(input, src, low, mid - 1);
}
else
return