【50算法基础】C++二分查找递归和非递归实现

最新推荐文章于 2024-03-06 10:08:51 发布

原创最新推荐文章于 2024-03-06 10:08:51 发布 · 287 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#50

本文详细介绍了二分查找算法的两种实现方式：非递归和递归。通过具体代码示例，展示了如何在有序数组中查找指定元素的位置，以及如何处理查找失败的情况。文章适合初学者理解二分查找的基本原理和应用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <iostream>
 
using namespace std;
 
//非递归实现
int BinarySearch(int array[], int len, int value)
{
	if (array == NULL || len <= 0)
		return -1;
 
	int low = 0;
	int high = len - 1;
	while (low <= high)
	{
		int mid = low + (high - low) / 2;
		if (array[mid] == value)
			return mid;
		else if (array[mid] > value)
			high = mid - 1;
		else
			low = mid + 1;
	}
 
	return -1;
}
//递归实现
int BinarySearch_Recursive(int array[], int low, int high, int value)
{
	if (low > high)
		return -1;
	int mid = low + (high - low) / 2;
	if (array[mid] == value)
		return mid;
	else if (array[mid] > value)
		return BinarySearch_Recursive(array, low, mid - 1, value);
	else
		return BinarySearch_Recursive(array, mid + 1, high, value);
 
}
 
int main(int argc, char *argv[])
{
	int i, j;
	int arr[10];
	for (i = 0; i < 10; i++)
	{
		arr[i] = i * 2;
	}
	cout << "Input the search number:";
	cin >> j;
	int location  = BinarySearch(arr, 10, j);
	if (location != -1)
		cout << "Exist1:" << location << endl;
	else
		cout << "Not existed in array!" << endl;
	location = BinarySearch_Recursive(arr, 0, 9, j);
	if (location != -1)
		cout << "Exist2:" << location << endl;
	else
		cout << "Not existed in array!" << endl;
	system("pause");
	return 0;
}