updated comments

ishitagupta8720 · web-flow · commit d29562dbb56a · 2019-10-20T13:03:10.000+05:30
diff --git a/Binary_search.py b/Binary_search.py
@@ -3,7 +3,7 @@
 def binarySearch(arr, l, r, x):
     while l <= r:
 
-        mid = l + (r - l) / 2; #extracting the middle element of the array
+        mid = l + (r - l) / 2; #extracting the middle element from the array
 
         # Check if x is present at mid 
         if arr[mid] == x:
