mirror of
https://hub.njuu.cf/TheAlgorithms/Python.git
synced 2023-10-11 13:06:12 +08:00
commit
90df6533dd
@ -9,7 +9,7 @@ def binarySearch(alist, item):
|
|||||||
midpoint = (first + last)//2
|
midpoint = (first + last)//2
|
||||||
if alist[midpoint] == item:
|
if alist[midpoint] == item:
|
||||||
found = True
|
found = True
|
||||||
print("Found")
|
print("Found [ at position: %s ]" % (alist.index(item) + 1))
|
||||||
else:
|
else:
|
||||||
|
|
||||||
if item < alist[midpoint]:
|
if item < alist[midpoint]:
|
||||||
@ -17,9 +17,10 @@ def binarySearch(alist, item):
|
|||||||
last = midpoint-1
|
last = midpoint-1
|
||||||
else:
|
else:
|
||||||
first = midpoint+1
|
first = midpoint+1
|
||||||
|
|
||||||
if found == False:
|
if found == False:
|
||||||
|
continue
|
||||||
print("Not found")
|
# print("Not found")
|
||||||
return found
|
return found
|
||||||
print("Enter numbers seprated by space")
|
print("Enter numbers seprated by space")
|
||||||
s = input()
|
s = input()
|
||||||
|
Loading…
Reference in New Issue
Block a user