Repeat Part a of the previous exercise, but now assume that we are not equally likely to search for each value in the array. We could arrange the n items in the array such that the ones we are more likely to search for occur first. Suppose that we search for the first item one half of the time, the second item one quarter of the time, the third item one eighth of the time, and so on. We will search for the last two items of the time. Revise the table in the previous exercise accordingly.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here