Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit da9a519

Browse files
committed
add heap sort
1 parent fd16f68 commit da9a519

File tree

1 file changed

+8
-0
lines changed

1 file changed

+8
-0
lines changed

‎docs/7.heap_sort.md‎

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
# 堆排序
2+
3+
## 概述
4+
堆排序(Heapsort)是指利用堆这种数据结构所设计的一种排序算法。堆积是一个近似完全二叉树的结构,并同时满足堆积的性质:即子结点的键值或索引总是小于(或者大于)它的父节点。堆排序可以说是一种利用堆的概念来排序的选择排序。
5+
6+
## 算法步骤
7+
8+

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /