Skip to main content

Linear search [Data structures]

Linear search is a technique of searching elements in a list or array. As this name suggest linear, means a sequential searching in this we start searching our desired data/element from the start or initial stage of the list and this searching operation has been stopped at the end of the given list even our element is already found in between of the list it is a disadvantage of this technique but it deals with a unordered or unsorted list.

Comments

Popular posts from this blog

Runnable Interfaces Before and After Java8

explicit and implicit import vs static import in java