-
Notifications
You must be signed in to change notification settings - Fork 46
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Added binary search to python folder
- Loading branch information
Showing
1 changed file
with
38 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,38 @@ | ||
def binary_search(arr, low, high, x): | ||
|
||
# Check base case | ||
if high >= low: | ||
|
||
mid = (high + low) // 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 binary_search(arr, low, mid - 1, x) | ||
|
||
# Else the element can only be present in right subarray | ||
else: | ||
return binary_search(arr, mid + 1, high, x) | ||
|
||
else: | ||
# Element is not present in the array | ||
return -1 | ||
|
||
|
||
# Test array | ||
arr = input('Enter the elements ').split(',') | ||
arr = [int(i) for i in arr] | ||
|
||
x = int(input('Enter the element to be searched ')) | ||
|
||
# Function call | ||
result = binary_search(arr, 0, len(arr)-1, x) | ||
|
||
if result != -1: | ||
print("Element is present at index", str(result)) | ||
else: | ||
print("Element is not present in array") |