Computer Science, asked by vpa91153, 8 months ago

State the limitation of linear search in terms of time complexity​

Answers

Answered by subhasish3444
2

Answer:

the answer is 1

Explanation:

limitation of linear serch is 1

Answered by tamannapurohit10
6

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.

HOPE YOU LIKE THIS ANSWER

PLEASE MARK IT AS BRAINLIEST

Similar questions