Question

a.One important application of logarithms is found in various computer search routines. For example, a binary search algorithm on a table (or array) of data takes a maximum of log2n (“log base 2, of n”) steps to complete, where n is the number of data elements that can be searched. How many steps (at most) are needed for a search of a table with 16 elements? 512 elements? Explain

Answer 1

The log base 2 of 16 is 4 because 2^4=16; the log base 2 of 512 is 9 because 2^9=512

Answer 2

Thank you!