-
Notifications
You must be signed in to change notification settings - Fork 0
/
BinarySearchUsingRecursion.cpp
74 lines (72 loc) · 1.44 KB
/
BinarySearchUsingRecursion.cpp
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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
// Implemented by Kritagya Kumra
#include <iostream>
using namespace std;
// Way 1
bool Binary_Search(int A[], int start, int end, int key)
{
int mid = (start + end) / 2;
if (start > end)
{
return false;
}
if (A[mid] == key)
{
return true;
}
else
{
bool ans = 0;
if (A[mid] < key)
{
start = mid + 1;
bool ans = Binary_Search(A, start, end, key);
return ans;
}
else
{
end = mid - 1;
bool ans1 = Binary_Search(A, start, end, key);
return ans1;
}
}
}
// Way 2
// bool Binary_Search(int A[], int start, int end, int key)
// {
// int mid = (start + end) / 2;
// if (start > end)
// {
// return false;
// }
// if (A[mid] == key)
// {
// return true;
// }
// else
// {
// if (A[mid] < key)
// {
// return Binary_Search(A, mid + 1, end, key);
// }
// else
// {
// return Binary_Search(A, start, mid - 1, key);
// }
// }
// }
int main()
{
int array[6] = {3, 5, 7, 8, 10, 20};
int n = sizeof(array) / sizeof(array[0]);
bool result = Binary_Search(array, 0, n - 1, 10);
if (result)
{
cout << "Element found";
}
else
{
cout << "Element not found";
}
return 0;
}
// Implemented by Kritagya Kumra