by Guest » Sun Sep 19, 2021 11:47 am
Consider the sequential search algorithm for an unordered list of n elements and a target value x. Find the expected value X of the number of comparisons to search for x if x is equally likely to be at any of the n positions in the list or not in the list.