递归算法实现二分查找，并给出查找结果。

最新推荐文章于 2024-10-01 04:50:10 发布

2301_77901428

最新推荐文章于 2024-10-01 04:50:10 发布

阅读量58

点赞数

文章标签：算法 java 数据结构

本文链接：https://blog.csdn.net/2301_77901428/article/details/134428682

版权

#include <stdio.h>
int binarySearch(int arr[], int left, int right, int x) {
if (right >= left) {
int mid = left + (right - left) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, left, mid - 1, x);
return binarySearch(arr, mid + 1, right, x);
}
return -1;
}

int main() {
int arr[] = {1, 3, 5, 7, 8, 9, 10, 16, 18, 20, 21}; int n = sizeof(arr) / sizeof(arr[0]);
int x = 9;
int result = binarySearch(arr, 0, n - 1, x);
if (result == -1)
printf("Element is not present in array");
else
printf("Element is present at index %d", result);
return 0;
}