Talk:TADM2E 4.13

From Algorithm Wiki
Revision as of 16:18, 10 February 2015 by Brownslink (talk | contribs) (Part 3 Possibly Incorrect)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

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.