Hello this is Gulshan Negi
Well, I am creating a program for binary search algorithm using Python program but there is a problem in its execution, I don’t know what I am doing wrong here.
Source Code:-
def binary_search(a_list, an_item):
first = 0
last = len(a_list) – 1
while first <= last:
mid_point = (first + last) // 2
if a_list[mid_point] == an_item:
return True
else:
if an_item < a_list[mid_point]:
last = mid_point – 1
else:
first = mid_point + 1
return False
def binary_search_rec(a_list, first, last, an_item):
if len(a_list) == 0:
return False
else:
mid_point = (first + last) // 2
if a_list[mid_point] == an_item:
return True
else:
if an_item < a_list[mid_point]:
last = mid_point – 1
return binary_search_rec(a_list, first, last, an_item)
else:
first = mid_point + 1
return binary_search_rec(a_list, first, last, an_item)
if __name__ == ‘__main__’:
a_list = [1, 4, 7, 10, 14, 19, 102, 2575, 10000]
print(‘Binary Search:’, binary_search(a_list, 4))
print(‘Binary Search Recursive:’,
binary_search_rec(a_list, 0, len(a_list) 1, 4))
Can anyone give their suggestions on this, would be a great support in this regard.
Thanks
Note: promotional URL removed by moderator.
