> 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/algorithm-analysis-and-design.md).

# Algorithm Analysis & Design

{% hint style="info" %}
This notebook will dwell on how many of the algorithms work. At the same time, the notebook will provide and solve popular questions and small and simple games based on those algorithms to form a better understanding of the algorithms.
{% endhint %}

![](/files/w3mnpI3gBwmlEqNM1wAc)

{% hint style="info" %}

#### An algorithm is like a recipe.

{% endhint %}

Follow this handy guide to get started on the basics as quickly as possible:

{% content-ref url="/pages/7EMfWdooHE8VrFbw8P2Q" %}
[Searching and Sorting](/algorithms/searching-and-sorting/introduction-search.md)
{% endcontent-ref %}

{% content-ref url="/pages/vaB1TJeK53YYMnamIMcY" %}
[Greedy Method](/algorithms/greedy-method/introduction.md)
{% endcontent-ref %}

{% content-ref url="/pages/g16drfiX00vGSDuqEkwz" %}
[Backtracking](/algorithms/backtracking/introduction.md)
{% endcontent-ref %}

{% content-ref url="/pages/BZWXbdVUplylfnyFu0qk" %}
[Divide and Conquer](/algorithms/divide-and-conquer/introduction.md)
{% endcontent-ref %}

{% content-ref url="/pages/zypXeuejPa4dPXKo1dUu" %}
[Dynamic Programming](/algorithms/dynamic-programming/introduction.md)
{% endcontent-ref %}

{% content-ref url="/pages/YhNiYqq6TwOuPmfSazaG" %}
[Graph](/algorithms/graph/introduction.md)
{% endcontent-ref %}

{% content-ref url="/pages/9uOnwCdI4OiTpJhYqlFa" %}
[Number Theory](/algorithms/number-theory/introduction.md)
{% endcontent-ref %}