> For the complete documentation index, see [llms.txt](https://soveet-nayak.gitbook.io/algorithms/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://soveet-nayak.gitbook.io/algorithms/searching-and-sorting/introduction-search.md).

# Introduction-Search

One of the most important topics in DSA is sorting and searching. One of the most prevalent uses of computers nowadays is for storing and retrieving data. 

The quantity of data and information kept and accessed by computers has grown over time, resulting in massive databases. To properly manage and handle information in databases, a plethora of approaches and algorithms have been created.

![](https://99772386-files.gitbook.io/~/files/v0/b/gitbook-x-prod.appspot.com/o/spaces%2F-Ml1CeryuEyvAp_NEaaR%2Fuploads%2FKCeVco5aUC0rhLv1mhD6%2Fsearching.gif?alt=media\&token=5132dabb-b9b3-4f4a-bff9-c7ddcb975070)

**The most common searching algorithms are:**

{% content-ref url="/pages/LEet5qQTEDKz8QYdCYtX" %}
[Linear Search](/algorithms/searching-and-sorting/linear-search.md)
{% endcontent-ref %}

{% content-ref url="/pages/4XKR6kH5Z3IY4k8tNvpo" %}
[Binary Search](/algorithms/searching-and-sorting/binary-search.md)
{% endcontent-ref %}

{% content-ref url="/pages/KeZdJ4lNN1Bn5NICkjcu" %}
[Interpolation Search](/algorithms/searching-and-sorting/interpolation-search.md)
{% endcontent-ref %}