...
Algorithms
October 13, 2023
Sorting
October 13, 2023
Algorithms
October 13, 2023
Sorting
October 13, 2023

Sorting

Question 62
There is an unsorted list of n integers. You are given 3 distinct integers and you have to check if all 3 integers are present in the list or not. The only operation that you are allowed to perform is a comparison. Let A be an algorithm for this task that performs the least number of comparisons. Let c be the number of comparisons done by A. Then,
A
c = 3n
B
c = 2n + 5
C
c ≥ 3n − 1
D
c ≤ n
E
c ≤ 2n + 3
Correct Answer: E

Leave a Reply

Your email address will not be published. Required fields are marked *