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
Appearance settings

Update 7.heapSort.md #24

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
hustcc merged 2 commits into from
Aug 13, 2019
Merged

Update 7.heapSort.md #24

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
8ecbb3c
Update 7.heapSort.md
waterhellall Feb 22, 2019
5f8c2ab
Update 7.heapSort.md
waterhellall Feb 22, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions 4 7.heapSort.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,7 +10,7 @@

## 1. 算法步骤

1. 创建一个堆 H[0……n-1]；
1. 将待排序序列构建成一个堆 H[0……n-1]，根据（升序降序需求）选择大顶堆或小顶堆；

2. 把堆首（最大值）和堆尾互换；

Expand Down Expand Up @@ -254,4 +254,4 @@ function heapSort($arr) {
}
return $arr;
}
```
```
Morty Proxy This is a proxified and sanitized view of the page, visit original site.