Skip to content

Commit 6cd1226

Browse files
waterhellallhustcc
authored andcommitted
Update 7.heapSort.md (#24)
* Update 7.heapSort.md 建议修改下第一步的说明 * Update 7.heapSort.md
1 parent a33fef7 commit 6cd1226

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

7.heapSort.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,7 @@
1010

1111
## 1. 算法步骤
1212

13-
1. 创建一个堆 H[0……n-1]
13+
1. 将待排序序列构建成一个堆 H[0……n-1],根据(升序降序需求)选择大顶堆或小顶堆
1414

1515
2. 把堆首(最大值)和堆尾互换;
1616

@@ -254,4 +254,4 @@ function heapSort($arr) {
254254
}
255255
return $arr;
256256
}
257-
```
257+
```

0 commit comments

Comments
 (0)