From 48e5c2a5d56e43f728e433ce19f34814a402d071 Mon Sep 17 00:00:00 2001 From: aka4rKO Date: Mon, 8 Oct 2018 13:52:16 +0530 Subject: [PATCH 1/2] Create binary_search.py --- code/binary_search.py | 40 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 code/binary_search.py diff --git a/code/binary_search.py b/code/binary_search.py new file mode 100644 index 0000000..6fe0324 --- /dev/null +++ b/code/binary_search.py @@ -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" From bf07560824629594cf102d3504604e9a9b0cbc68 Mon Sep 17 00:00:00 2001 From: Luke Oliff Date: Mon, 8 Oct 2018 17:31:49 +0100 Subject: [PATCH 2/2] Rename binary_search.py to aka4rKO.py --- code/{binary_search.py => aka4rKO.py} | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename code/{binary_search.py => aka4rKO.py} (100%) diff --git a/code/binary_search.py b/code/aka4rKO.py similarity index 100% rename from code/binary_search.py rename to code/aka4rKO.py