Aspire Faculty ID #17614 · Topic: JAMIA MILLIA ISLAMIA MCA 2025 · Just now
JAMIA MILLIA ISLAMIA MCA 2025

What is the time complexity of a linear search in an unsorted array?

Solution

Linear search checks each element sequentially until the desired element is found. In the worst case it checks all elements. Time Complexity = O(n)

Previous 10 Questions — JAMIA MILLIA ISLAMIA MCA 2025

Nearest first

Next 10 Questions — JAMIA MILLIA ISLAMIA MCA 2025

Ascending by ID
Ask Your Question or Put Your Review.

loading...