forked from Haresh1204/Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
BinarySearch.py
87 lines (65 loc) · 2.24 KB
/
BinarySearch.py
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
75
76
77
78
79
80
81
82
83
84
85
86
87
# WE CAN IMPLEMENT BINARY SEARCH USING TWO WAYS:--
#1. Iterative Approach
#2. Recursive Approach
#--------------------------------------------------------------------------------------------------------------------------------------------------------------------
#1 - ITERATIVE Approach
# It returns location of x in given array arr
# if present, else returns -1
def binarysearch(arr,n,x): #
left=0
right=n-1
while(left<right):
mid=(left+right)//2
#check if x is present at mid
if arr[mid]==x:
return mid
# If x is greater, ignore left part
elif (arr[mid]>x):
right=mid-1
# If x is smaller, ignore right part
else:
left=mid+1
#IF WE REACH HERE THATS MEAN ELEMENT IS NOT PRESENT IN THE ARRAY
return -1
#Driver Code
arr=list(map(int,input().split()))
x=int(input())
n=len(arr)
#Function Call
answer = binarysearch(arr,n,x)
if answer==-1:
print("ELEMENT IS NOT FOUND IN THE ARRAY")
else:
print("ElEMENT IS FOUND AT INDEX % d" % answer)
# --------------------------------------------------------------------------------------------------------------------------------------------------------------
# 2. Recursive Approach
# Python3 Program for recursive binary search.
# Returns index of x in arr if present, else -1
def binarySearch(arr, l, r, x):
# Check base case
if r >= l:
mid = l + (r - l) // 2
# If element is present at the middle itself
if arr[mid] == x:
return mid
# If element is smaller than mid, then it
# can only be present in left subarray
elif arr[mid] > x:
return binarySearch(arr, l, mid-1, x)
# Else the element can only be present
# in right subarray
else:
return binarySearch(arr, mid + 1, r, x)
else:
# Element is not present in the array
return -1
# Driver Code
arr = list(map(int,input().split()))
x = int(input()
# Function call
answer = binarySearch(arr, 0, len(arr)-1, x)
if result == -1:
print("Element is not present in array")
else:
print("Element is present at index % d" % answer)
# ------------------------------------------------------------------------------------------------------------------------------------------