Question

The complexity of linear search algorithm is
A) O(n2)
B) O(n log n)
C) O(n)
D) O(log n)

Answer 1

The complexity of linear search algorithm is
A) O(n2)✔️✔️✔️✔️
B) O(n log n)
C) O(n)
D) O(log n)



Answer: a
Explanation: The worst case complexity of linear search is O(n

Answer 2

The complexity of linear search algorithm is
A) O(n2)✔
B) O(n log n)
C) O(n)
D) O(log n)


ĀNSWĒR ⏬


A. O(n2)

Thanks ✌✌


# NAVI ❤ HARYANVI ♠