Question

2. State the limitations of Linear Search in terms of Time Complexity,
​

Answer 1

Answer:

$\underline{\huge{Answer:-}}$

A linear search runs in at worst linear time and makes at most n comparisons, where n is the length of the list. ... Linear search is rarely practical because other search algorithms and schemes, such as the binary search algorithm and hash tables, allow significantly faster searching for all but short lists.

Answer 2

Answer:

linear search runs in at worst linear time and makes at most n comparisons, where n is the length of the list. ... Linear search is rarely practical because other search algorithms and schemes, such as the binary search algorithm and hash tables, allow significantly faster searching for all but short lists.