# Simple Sorts

The following sorting algorithms are some of the easiest to understand.  They are relatively easy to implement and they are typically the first algorithms you learn.  However, their runtimes are not very good and are not useful unless the data set is very small.

{% content-ref url="/pages/-LICIkb4OXkbpqMHwz92" %}
[Bubble Sort](/data-strutures-and-algorithms/sorting/simple-sorts/the-simple-sorts.md)
{% endcontent-ref %}

{% content-ref url="/pages/-LKz7Gmh56LXEzQcIDsn" %}
[Insertion Sort](/data-strutures-and-algorithms/sorting/simple-sorts/insertion-sort.md)
{% endcontent-ref %}

{% content-ref url="/pages/-LKz7pNtjnO03hEznXrP" %}
[Selection Sort](/data-strutures-and-algorithms/sorting/simple-sorts/selection-sort.md)
{% endcontent-ref %}


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://catherine-leung.gitbook.io/data-strutures-and-algorithms/sorting/simple-sorts.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.