Update Binary_search.py

Author: Utkarshrathore98

Binary_search.py

@@ -14,7 +14,7 @@ def binarySearch(arr, l, r, x):
             l = mid + 1 #l is initialised to the rightmost element of the middle so that the search could be started from there the next time
 
         # If x is smaller, ignore right half 
-        else:
+        elif x<arr[mid]:
             r = mid - 1 #r is initialised to the leftmost element of the middle so that the search goes till there only the next time
 
     # If we reach here, then the element was not present 
@@ -27,7 +27,7 @@ def binarySearch(arr, l, r, x):
     print("Enter the array with comma separated in which element will be searched")
     arr =[int(x) for x in input().split(',')] #the input array will of int type with each element seperated with a comma due to the split fucntion
                                        #map function returns a list of results after applying the given function to each item
-    x = int(input("Enter the element you want to search in given array"))
+    x = eval(input("Enter the element you want to search in given array"))
 
     # Function call
     result = binarySearch(arr, 0, len(arr) - 1, x)