chapter_heap/summary/ #390
giscus[bot]
bot
Replies: 7 comments
-
|
注意： 元素入堆 这里应该指的是单个元素入堆的时间复杂度为O(log n），对于将n个元素入堆的总体平均时间复杂度前文也提到为O(nlog n）， 只不多通过建堆的操作优化可以将时间复杂度降低到O(n) |
Beta Was this translation helpful? Give feedback.
0 replies
-
|
#It’s so well written! |
Beta Was this translation helpful? Give feedback.
0 replies
-
|
最后的q&a解决了我一直以来的疑问。数据结构中的堆和内存管理中的堆只是恰好重名 |
Beta Was this translation helpful? Give feedback.
0 replies
-
|
2024.5.19 finish. |
Beta Was this translation helpful? Give feedback.
0 replies
-
|
感谢！最后一个QA真的非常棒！ |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
chapter_heap/summary/
一本动画图解、能运行、可提问的数据结构与算法入门书
https://www.hello-algo.com/chapter_heap/summary/
Beta Was this translation helpful? Give feedback.
All reactions