forked from SHabaj-dev/Hactoberfest-2022
-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #6 from AmanShrivastava2710/master
Create binary_search.py
- Loading branch information
Showing
1 changed file
with
37 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,37 @@ | ||
# Python 3 program for recursive binary search. | ||
|
||
|
||
# Returns index of x in arr if present, else -1 | ||
def binary_search(arr, low, high, x): | ||
|
||
if high >= low: | ||
|
||
mid = (high + low) // 2 | ||
|
||
|
||
if arr[mid] == x: | ||
return mid | ||
|
||
|
||
elif arr[mid] > x: | ||
return binary_search(arr, low, mid - 1, x) | ||
|
||
|
||
else: | ||
return binary_search(arr, mid + 1, high, x) | ||
|
||
else: | ||
|
||
return -1 | ||
|
||
|
||
arr = [ 2, 3, 4, 10, 40 ] | ||
x = 10 | ||
|
||
|
||
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") |