Dark Mode

103 views

1 vote

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,

- $c=3 n$
- $c=2 n+5$
- $c \geq 3 n-1$
- $c \leq n$
- $c \leq 2 n+3 $