From fbde818e6b13e651fe093811937a0911e0059886 Mon Sep 17 00:00:00 2001 From: Muhammad Zain Kanji Date: Fri, 28 Oct 2022 23:10:51 +0500 Subject: [PATCH] Bineary Search Bineary Search Implement on Python with user Input --- BinarySearch.py | 22 ++++++++++++++++++++++ 1 file changed, 22 insertions(+) create mode 100644 BinarySearch.py diff --git a/BinarySearch.py b/BinarySearch.py new file mode 100644 index 0000000..e00e617 --- /dev/null +++ b/BinarySearch.py @@ -0,0 +1,22 @@ +# Binary Search in python + +def binarySearch(array, x, low, high): + + # Repeat until the pointers low and high meet each other + while low <= high: + mid = low + (high - low)//2 + if array[mid] == x: + return mid + elif array[mid] < x: + low = mid + 1 + else: + high = mid - 1 + return -1 + +array = [1,2,3,4,5,6,7,8,9] +x = input("Enter your value: ") +result = binarySearch(array, int(x), 0, len(array)-1) +if result != -1: + print(x + "\tElement is present at index " + str(result)) +else: + print("Not found") \ No newline at end of file