A linear search works well for arrays that are very large (thousands or millions of elements).

Name: A linear search works well for arrays that are very large (thousands or millions of elements).
Brand: Quizplus
Rating: 4.8 (38 reviews)

Question

Quizplus · Accepted Answer

A linear search has a time complexity of O(n), meaning that as the size of the array increases, the time it takes to search the entire array also increases proportionally. For very large arrays, this can become impractical and alternative algorithms such as binary search or hash tables are more efficient.

A Linear Search Works Well for Arrays That Are Very