二分查找的递归与迭代实现

//递归版本int BinarySearch (int[] a, int low, int high, int searchValue){if (high < low)return -1;int mid;mid = low + ((high - low) / 2);if (a [mid] > searchValue)return BinarySearch (a, low, mid-1, searchValue);else if (a [mid] < searchValue)return BinarySearch (a, mid + 1, high, searchValue);else return mid;} //迭代版本：int binary_search( int *a, int n, int key ){int mid, front=0, back=n-1;while (front<=back){mid = (front+back)/2;if (a[mid]==key)return mid;if (a[mid]<key)front = mid+1;else back = mid-1;}return -1;}