Merge pull request #1 from H-Darji/master

Minor improvement

Author: dynamitechetan

Diff for: BinarySeach.py

@@ -9,17 +9,18 @@ def binarySearch(alist, item):
         midpoint = (first + last)//2
         if alist[midpoint] == item:
              found = True
-             print("Found")
+             print("Found [ at position: %s ]" % (alist.index(item) + 1))
         else:
 
             if item < alist[midpoint]:
 
                 last = midpoint-1
             else:
                 first = midpoint+1
+                
         if found == False:
-            
-            print("Not found")
+            continue
+            # print("Not found")
     return found
 print("Enter numbers seprated by space")
 s = input()