Skip to content
#

linear-search

Here are 76 public repositories matching this topic...

Searching Algorithms are designed to check for an element or retrieve an element from any data structure where it is stored. Based on the type of search operation, these algorithms are generally classified into two categories:1-Sequential Search: In this, the list or array is traversed sequentially and every element is checked(Linear Search),2-Interval Search: These algorithms are specifically designed for searching in sorted data-structures. These type of searching algorithms are much more efficient than Linear Search as they repeatedly target the center of the search structure and divide the search space in half (Binary Search).

  • Updated Jun 2, 2020
  • C++

Improve this page

Add a description, image, and links to the linear-search topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the linear-search topic, visit your repo's landing page and select "manage topics."

Learn more

You can’t perform that action at this time.