Q10
MCQ1 mark, −0.33Consider an unordered list of distinct integers. What is the minimum number of element comparisons required to find an integer in the list that is NOT the largest in the list?
Sign in to save attempts.
Loading…
Consider an unordered list of distinct integers. What is the minimum number of element comparisons required to find an integer in the list that is NOT the largest in the list?
Loading…