As shown in Section 2.1, the average number of key comparisons made by sequential search (without a sentinel, under standard assumptions about its inputs) is given by the formula
Where p is the probability of a successful search. Determine, for a fixed n, the values of p (0 ≤ p ≤ 1) for which this formula yields the maximum value of Cavg(n) and the minimum value of Cavg(n).
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.