For a given list of values in ascending order, write a method in Pytho

1.	For a given list of values in ascending order, write a method in Python to search for a value with the help of Binary Search method. The method should return position of the value and should return -1 if the value not present in the list.
Answer» def Binary Search (list, search): lower_bound=0 upper_bond=len(list) -1 found=false pos=’x’ while lower_bound< =upper_bond: middle_pos=(lower_bound + upper_bond)/2 if list [middle_pos] = = search: pos=middlepos found=True break elif search < list [middle_pos]: upper_bound=middle_pos-l else: lower_bound=middle_pos + 1 if found: print(“The item found”, pos) else: print (“The item not available”) return (-1)

For a given list of values in ascending order, write a method in Python to search for a value with the help of Binary Search method. The method should return position of the value and should return -1 if the value not present in the list.

Answer»

def Binary Search (list, search):

lower_bound=0

upper_bond=len(list) -1

found=false

pos=’x’

while lower_bound< =upper_bond:

middle_pos=(lower_bound + upper_bond)/2

if list [middle_pos] = = search:

pos=middlepos found=True break

elif search < list [middle_pos]:

upper_bound=middle_pos-l else:

lower_bound=middle_pos + 1 if found:

print(“The item found”, pos) else:

print (“The item not available”)

return (-1)