c语言之二分法查找循环版本与递归版本案例及代码

#include <stdio.h>
#include <iostream>
using namespace std;
int binFind(int arr[], int value,int left,int right)
{
	while (left <= right)
	{	
		int mid = (left + right) >> 1;
		if (arr[mid] == value) return mid; //找到
		if (arr[mid] > value)
		{
			right = mid - 1 ;
		}
		else
		{
			left = mid + 1 ;
		}
	}
	return -1; //没有找到
}

//递归版本
int binSearchForTraverse(int arr[], int value, int left, int right)
{
	while (left <= right)
	{
		int mid = (left + right) >> 1;
		if (arr[mid] == value) return mid; //找到

		if (arr[mid] > value)
		{
			return binSearchForTraverse(arr, value, left, mid - 1);
		}
		else
		{
			return binSearchForTraverse(arr, value, mid + 1, right);
		}
	}
}

int main()
{
	int arr[] = { 0,1,2,3,4,5,6,7,8,9 };
	cout << binSearchForTraverse(arr, 5, 0, 9) << endl;
	system("pause");
	return 0;
}