PA of Algorithms Q32

0. Consider the following algorithm for searching for a given number x in an unsorted array A[1 .......n] having n distinct values:
1. Choose an i uniformly at random from 1.. .n;
2. If A[i] = x then Stop else Goto 1;
Assuming that x is present on A, what is the expected number of comparisons made by the algorithm before it terminates?

Answer
Comment
Array

Option : A
Explanation : The expected number of comparison is n.

Forgot your password?

I agree with the Terms.