Talk:TADM2E 4.13

From Algorithm Wiki

Revision as of 09:52, 30 December 2016 by Joky (talk | contribs)

(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.

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

Retrieved from "https://algorist.com/algowiki_v2/index.php?title=Talk:TADM2E_4.13&oldid=482"