# Difference between revisions of "Talk:TADM2E 4.13"

From Algorithm Wiki

Brownslink (Talk | contribs) (Part 3 Possibly Incorrect) |
|||

Line 1: | Line 1: | ||

Section 4.3.2 of the book contradicts part 3 of this answer. The section explains why it takes O( n log n) to construct a heap. | Section 4.3.2 of the book contradicts part 3 of this answer. The section explains why it takes O( n log n) to construct a heap. | ||

+ | |||

+ | => But Section 4.3.4 is titled "Faster Heap Construction" and explain how to get O(n) :) |

## Latest revision as of 09:52, 30 December 2016

Section 4.3.2 of the book contradicts part 3 of this answer. The section explains why it takes O( n log n) to construct a heap.

=> But Section 4.3.4 is titled "Faster Heap Construction" and explain how to get O(n) :)