Talk:D-ary heap
 | This article is rated B-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Untitled[edit]
"Finally, there is evidence suggesting that 4-heaps may outperform binary heaps in practice." -- where? —Preceding unsigned comment added by 92.202.61.252 (talk) 13:52, 5 August 2010 (UTC)
Over half of the page is literally copied and pasted from page 216 "Data Structures and Algorithm Analysis" -- ISBN: 0321370139, 2nd edition. Also referring to the comment above, the claim that 4-heaps outperform binary heaps in practice is a claim also made in this book. Cavillis (talk) 19:35, 30 October 2010 (UTC)
- Thank you for providing the evidence! If you have that book with the ISBN number, you can carefully try to remove the stuff which the text has been copied from. It would be greatly appreciated! Minimac (talk) 06:11, 31 October 2010 (UTC)
- I removed the copied and pasted text. I originally left it there with the hope someone would come by and rewrite, I wanted the page to remain useful to those looking up d heaps.
129.110.5.92 (talk) 21:35, 2 November 2010 (UTC)