The linear search is adequate for searching through ________ arrays, but not through ________ ones.
A) int, double
B) char, string
C) ascending, descending
D) small, large
E) any regular, vector

Question

Quizplus · Accepted Answer

The linear search algorithm has a time complexity of O(n), meaning it searches through every element in the array until it finds the desired value. This makes it suitable for small arrays, but as the array size grows the search time becomes impractical, which is why larger arrays are better searched using more efficient algorithms like binary search. Therefore, the linear search algorithm is adequate for searching through small arrays but not through large ones.

The Linear Search Is Adequate for Searching Through ________ Arrays