Skip to content

WELCOME TO EXCURTLE

Searching Techniques are used to check for the presence of an element and to retrieve the element or its position from a data structure where it is stored. For example, searching for a name in a contact list.
These Searching Algorithms can be categorized into two types:

  1. Sequential Search - All elements are checked one after the another like in Linear Search.
  2. Interval Search - The data structure is divided into intervals and only a few elements are checked which improves effiency and performance like in Binary Search. For example, to search for the name "Blake" in the contact list, would you start searching for all the names starting from A or would you simply go to the section with names starting with B?

Some Popular Searching Algorithms :-

Linear Search
Jump Search
Binary Search
Interpolation Search
Exponential Search