forked from sumanchaurasiya/python-problems
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbinary.py
More file actions
43 lines (22 loc) · 640 Bytes
/
binary.py
File metadata and controls
43 lines (22 loc) · 640 Bytes
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
# Recursive Binary Search algorithm in Python
def binarySearch(array, x, low, high):
if high >= low:
mid = low + (high - low)//2
# If found at mid, return the value
if array[mid] == x:
return mid
# Search the first half
elif array[mid] > x:
return binarySearch(array, x, low, mid-1)
# Search the second half
else:
return binarySearch(array, x, mid + 1, high)
else:
return -1
array = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
x = int(input("Enter a number between 1 and 10:"))
result = binarySearch(array, x, 0, len(array)-1)
if result != -1:
print("Element is present at position" + str(result))
else:
print("Element not found")