-
Notifications
You must be signed in to change notification settings - Fork 23.3k
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.
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
翻译了数据结构系列,二叉堆实现优先队列 #78
Conversation
@@ -0,0 +1,213 @@ | |||
# Binary heap detail implements priority queues | |||
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
|
||
Yes, the operations are inversely equivalent, but in the end we will only operate at the bottom and the top of the heap (we'll see why), and obviously the "misaligned" elements at the bottom of the heap need to float up, and the "misaligned" elements at the top of the heap need to sink. | ||
|
||
**上浮的代码实现:** |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
这句漏了?
|
||
**Commit to making the algorithm clear! Welcome to my WeChat public labuladong for more articles that are easy to understand**: | ||
|
||
 |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
文末二维码可删除,开头标注译者和作者即可。
感谢付出,就几个小问题,稍改一下即可合并~ |
这是第一个迭代版本,相信以后会有更好的翻译来进行迭代,我认为好的翻译应该是,特别精简,省略很多无关紧要的语言细节,仅仅用几个动词就可以表达很长的句子,当然这只是我的认为,我的翻译并没有做到这一点,希望后期版本越来越好,收获更多星星吧。