> For the complete documentation index, see [llms.txt](https://luweikxy.gitbook.io/machine-learning-notes/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://luweikxy.gitbook.io/machine-learning-notes/data-structures-and-algorithms/algorithms/sort.md).

# 排序

* [返回顶层目录](/machine-learning-notes/summary.md)
* [返上层目录](/machine-learning-notes/data-structures-and-algorithms/algorithms.md)
* [堆排序](/machine-learning-notes/data-structures-and-algorithms/algorithms/sort/heap-sort.md)
* [归并排序](/machine-learning-notes/data-structures-and-algorithms/algorithms/sort/merge-sort.md)
* [快速排序](/machine-learning-notes/data-structures-and-algorithms/algorithms/sort/quick-sort.md)

1. 冒泡排序
2. 选择排序：选择排序与冒泡排序有点像，只不过选择排序每次都是在确定了最小数的下标之后再进行交换，大大减少了交换的次数
3. 插入排序：将一个记录插入到已排序的有序表中，从而得到一个新的，记录数增1的有序表
4. 快速排序：通过一趟排序将序列分成左右两部分，其中左半部分的的值均比右半部分的值小，然后再分别对左右部分的记录进行排序，直到整个序列有序。

   ```cpp
   int partition(int a[],  int low, int high){
       int key = a[low];
       while( low < high ){
           while(low < high && a[high] >= key) high--;
           a[low] = a[high];
           while(low < high && a[low] <= key) low++;
           a[high] = a[low];
       }
       a[low] = key;
       return low;
   }
   void quick_sort(int a[], int low, int high){
       if(low >= high) return;
       int keypos = partition(a, low, high);
       quick_sort(a, low, keypos-1);
       quick_sort(a, keypos+1, high);
   }
   ```
5. 堆排序：假设序列有n个元素,先将这n建成大顶堆，然后取堆顶元素，与序列第n个元素交换，然后调整前n-1元素，使其重新成为堆，然后再取堆顶元素，与第n-1个元素交换，再调整前n-2个元素...直至整个序列有序。
6. 希尔排序：先将整个待排记录序列分割成为若干子序列分别进行直接插入排序，待整个序列中的记录基本有序时再对全体记录进行一次直接插入排序。
7. 归并排序：把有序表划分成元素个数尽量相等的两半，把两半元素分别排序，两个有序表合并成一个

\===

[这或许是东半球分析十大排序算法最好的一篇文章](https://mp.weixin.qq.com/s/4n0a3sDp0GIs6gFZ7TEZNQ)

[数据结构的那些排序算法总是记不住，这个真的背的吗？](https://www.zhihu.com/question/51337272/answer/438910111)

[必学十大经典排序算法，看这篇就够了(附完整代码/动图/优质文章)(修订版)](https://mp.weixin.qq.com/s/IAZnN00i65Ad3BicZy5kzQ)

[LeetCode按照怎样的顺序来刷题比较好？](https://www.zhihu.com/question/36738189/answer/864005192)


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## 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, and the optional `goal` query parameter:

```
GET https://luweikxy.gitbook.io/machine-learning-notes/data-structures-and-algorithms/algorithms/sort.md?ask=<question>&goal=<endgoal>
```

`ask` is the immediate question: it should be specific, self-contained, and written in natural language.
`goal` is optional and describes the broader end goal you are ultimately trying to accomplish on behalf of the user. GitBook uses it to tailor the answer towards what is most useful for that goal.

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.