> For the complete documentation index, see [llms.txt](https://catherine-leung.gitbook.io/data-strutures-and-algorithms/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://catherine-leung.gitbook.io/data-strutures-and-algorithms/sorting/simple-sorts.md).

# 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 %}