-
Notifications
You must be signed in to change notification settings - Fork 1
/
binarySearch.c
29 lines (27 loc) · 850 Bytes
/
binarySearch.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
// C program to implement recursive Binary Search
#include <stdio.h>
// A recursive binary search function.
int binarySearch(int arr[], int l, int r, int x){
if (r >= l) {
int mid = l + (r - l) / 2;
// itself
if (arr[mid] == x)
return mid;
// it can only be present in left subarray
if (arr[mid] > x)
return binarySearch(arr, l, mid - 1, x);
// in right subarray
return binarySearch(arr, mid + 1, r, x);
}
return -1;
}
int main(){
int arr[] = { 2, 3, 4, 10, 40 };
int n = sizeof(arr) / sizeof(arr[0]);
int x = 10;
int result = binarySearch(arr, 0, n - 1, x);
(result == -1) ? printf("Element is not present in array")
: printf("Element is present at index %d",
result);
return 0;
}