Merge pull request #289 from aka4rKO/patch-2

Create binary_search.py
This commit is contained in:
Luke Oliff 2018-10-08 09:32:04 -07:00 committed by GitHub
commit 4b7e51f8f3
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23

40
code/aka4rKO.py Normal file
View File

@ -0,0 +1,40 @@
# Python 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
# Test array
arr = [ 2, 3, 4, 10, 40 ]
x = 10
# Function call
result = binarySearch(arr, 0, len(arr)-1, x)
if result != -1:
print "Element is present at index %d" % result
else:
print "Element is not present in array"