The complexity of a linear search algorithm is

M

Mr. Dubey

🎓 Coach ⭐ 104.48K Points

📊 Database Management System (DBMS)

Q. The complexity of a 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)

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

801

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

99%

Success Rate