If a sorted list has 1,000,000 elements, approximately how m…
If a sorted list has 1,000,000 elements, approximately how much more work is it to do linear search compared to binary search in the worst case? In other words, what is (# units of work for linear) / (# units of work for binary)? Hint: Normally when we refer to “log” we mean the base 10 logarithm. However when dealing with things that you continuously cut in half, base 2 is what you want. Googling “log2(26)” will return the base 2 logarithm of 26.