Q. The complexity of linear search algorithm is

(A) o(n)
(B) o(log n)
(C) o(n2)
(D) o(n log n)

💬 Discuss

✅ Correct Answer: (A) o(n)

Published by Mr. Dubey ⭐ 111.42K Points at 13-Sep-2023 11:25 am in Data Structure and Algorithms (DSA)

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

105

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

99%

Success Rate