import time import random def sequential_search(mylist, number_of trials): lengthlen(mylist) if length = 0: return 1 timel time.clockO) for count in range(number_of_trials): if count % length-0: targetmylist[-1] 1 target-mylist [count % length] if target-- element: else: for element in mylist: break time2 time.clockO) return (time2 - time1) / number_of_trials def binary_search(mylist, number_of_trials): Lengthlen(mylist) if length 0: return -1 time1- time.clockO for count in range(number_of-trials): if count % 1ength 0: target-mylist[-1] .1 else: target-mylist [count % length] high-len(mylist) - 1 while low high: mid-(low + high) // 2 if mylist[mid]target: elif mylist[mid]