Question

Suppose that we time three functions in Python: linear searching, binary searching, and sorting. We determine their running times, based on the length of their list argument as:Tls(N) ~ 6.00x10-9 N, Tbs(N) ~ 1.80 x10-8Log2(N), and Ts(N) ~ 8.00 x10-7 N Log2 N. Suppose that we have a list of size N and we will search it Times (compute the time using these T functions). We can do a linear search each time or we can first sort the data (just once) and then do a binary search each time. How long does it take…(compute logs and show your answer to 3 significant digits, like the coefficients above) a1) to do a linear search of 100 values 100 times

Answer 1

Answer:

134

Explanation:

because 6.00×10-9 =51 and 1.80×10-8=10 and 8.00×10-7=73 by adding them it will give the answer out by the figuer 134