Editing Talk:Binary heap
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 1: | Line 1: | ||
This is the first time I have seen an average case analysis of the binary heap operations, and it is very helpful to know what they are since it shows that in practical real-world applications, it is probably better than many other structures mainly because of the low constants involved. Plus, the average case analysis helps analyze the average case running time of other algorithms that use the binary-heap as an auxiliary data structure. | This is the first time I have seen an average case analysis of the binary heap operations, and it is very helpful to know what they are since it shows that in practical real-world applications, it is probably better than many other structures mainly because of the low constants involved. Plus, the average case analysis helps analyze the average case running time of other algorithms that use the binary-heap as an auxiliary data structure. | ||
− | |||
− | |||
− |