What are advantages and disadvantages of linear search?

Answer 1

1)in linear search it needs more space and time complexity.

2) in linear search if the key element is the last element and the search is from first element that is a worst case, or if the key element is the first element and the search is from last element then also is the worst case.

Answer 2

The primary advantage of linear search is its simplicity: conceptually, it's extraordinarily easy to understand, and, implementation-wise, it's also very straight-forward. From an operational standpoint, linear search also is very resource efficient - it does not require copying/partitioning of the array being search, and thus is memory-efficient. It also operates equally well on both unsorted and sorted data.

The primary disadvantage of linear search is that it has a very poor O(n) general efficiency. That is, the performance of the algorithm scales linearly with the size of the input. For the general case, linear search thus is considerably slower than many other search algorithms.

In certain cases where additional information about the current contents of the list being searched are known, linear search can perform as good or better than many other types of search. For instance, if you can assume that the list you have is a FIFO or LIFO, and you know that the item you are looking for is either almost always recently added or almost always at the end of the list, then a tailored linear search can provide very good performance.

Answer 3

If the size of the array is large then it consumes much time, because as it compares the given element with every element of the array.

Answer 4

There no advantages to linear search other than searching for the first (or last) nodes. Linear search takes linear time with an average O(n/2) for each search.

Answer 5

limitation of sequential search

Answer 6

The main disadvantage of the linear search is that it is slow to process

lists