From b2c5e2dd0e5c104c52716f7b06f247bae6b8c434 Mon Sep 17 00:00:00 2001 From: apoorv tikalkar Date: Mon, 15 Oct 2018 18:17:46 +0530 Subject: [PATCH] Create binary_search.py --- binary_search.py | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 binary_search.py diff --git a/binary_search.py b/binary_search.py new file mode 100644 index 0000000..e5efa1f --- /dev/null +++ b/binary_search.py @@ -0,0 +1,27 @@ +def binarySearch(arr, l, r, x): + + while l <= r: + + mid = l + (r - l)/2; + + # Check if x is present at mid + if arr[mid] == x: + return mid + + # If x is greater, ignore left half + elif arr[mid] < x: + l = mid + 1 + + # If x is smaller, ignore right half + else: + r = mid - 1 + return -1 +arr = [ 2, 3, 4, 10, 40 ] +x = 10 + +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"