Sequential Search: In this, the list or array is traversed sequentially and every element is checked.These algorithms are mainly classified in 2 categories according to their type of search operations. These operations give one of the 2 possible outcomes- Success or Failure, i.e- ‘Success’ when target is found & ‘Failure’ when target is not found. They search for a target (key) in the search space, like. Searching Algorithms are designed to check or retrieve an element from any data structure where it is being stored. In computer science, there are various type of search algorithms available and the way they are used decides the performance and efficiency of the data available( the manner in which the data is being used).Īccording to Wikipedia- Search algorithm is-Īny algorithm which solves the search problem, namely, to retrieve information stored within some data structure, or calculated in the search space of a problem domain, either with discrete or continuous values. And they are expected to return a success or a failure status ( in boolean true or false value). Searching algorithms is a basic, fundamental step in computing done via step-by-step method to locate a specific data among a collection of data.Īll search algorithms make use of a search key in order to complete the procedure. When searching for data, the difference between a fast application and a slower one lies in the accurate use of search algorithm.

Quick word search algorithms