algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-19 07:17:54 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update .gitignore

Browse Source 
Add build script for Zig.
This commit is contained in:
krahets
2023-02-09 22:57:25 +08:00
parent 3465b300e9
commit ec25970e8e
30 changed files with 226 additions and 532 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
docs/chapter_heap/heap.md
View File

@@ -342,7 +342,11 @@ comments: true
=== "Zig"
```zig title="my_heap.zig"
[class]{MaxHeap}-[func]{left}
[class]{MaxHeap}-[func]{right}
[class]{MaxHeap}-[func]{parent}
```
### 访问堆顶元素
@@ -406,7 +410,7 @@ comments: true
=== "Zig"
```zig title="my_heap.zig"
[class]{MaxHeap}-[func]{peek}
```
### 元素入堆
@@ -506,7 +510,9 @@ comments: true
=== "Zig"
```zig title="my_heap.zig"
[class]{MaxHeap}-[func]{push}
[class]{MaxHeap}-[func]{siftUp}
```
### 堆顶元素出堆
@@ -622,7 +628,9 @@ comments: true
=== "Zig"
```zig title="my_heap.zig"
[class]{MaxHeap}-[func]{poll}
[class]{MaxHeap}-[func]{siftDown}
```
### 输入数据并建堆 *
@@ -688,7 +696,7 @@ comments: true
=== "Zig"
```zig title="my_heap.zig"
[class]{MaxHeap}-[func]{init}
```
那么，第二种建堆方法的时间复杂度时多少呢？我们来做一下简单推算。