Answer:
Linear search is the simplest form of search. It searches for the element sequentially starting from the first element. This search has a disadvantage if the element is located at the end. Advantage lies in the simplicity of the search. Also it is most useful when the elements are arranged in a random order.
| Previous Question | Next Question |
| Explain binary search? | What is Mergesort and Hashtable? |