> 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-sorting.md).

# Introduction-Sorting

### **What is sorting?**

Sorting is the process of placing elements from a collection in some kind of order. For example, a list of words could be sorted alphabetically or by length. Efficient sorting is important to optimize the use of other algorithms that require sorted lists to work correctly.

**Importance of sorting**

* To represent data in more readable format.
* Optimize data searching to high level.

**The most common sorting algorithms are:**

* Bubble Sort
* Insertion Sort
* Selection Sort
* Quick Sort
* Merge Sort
* Shell Sort