32 views

| 32 views
+1
For Linear Search, the worst case happens when the element to be searched is not present in the array. When it is not present, the element to be searched is compared with all the elements of array one by one. Therefore, the worst case time complexity of linear search would be Θ(n).
0
option 2 is correct according to me.
0
What is the difference between options 2 and 4?
+1
i guess option 4 means that the item is not present in the universal set containing all the items.

Example -1 does not belong to Natural Numbers.
0
Answer $2$, $3$ and $4$ both should be correct.

Also, the question looks to me poorly framed.

What's the source of this question??
0

@commenter commenter

Both are same only.

1
2