Talk:Beap
Latest comment: 1 year ago by Ruakh in topic Do the elements on the same level have to be sorted?
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||
beap
editWho is William? --Abdull 17:55, 6 March 2006 (UTC)
The well known Heap data structure as described by J.W.J Williams in Algorithms 232, Heapsort, Comm. ACM 7 (June 1964), 347-348. Perhaps I put the appostraphe in an incorrect place -- IlyaTheMuromets 22:37, 8 Jan 2007 (EST)
Do the elements on the same level have to be sorted?
editThe diagram in the article suggests that they do. - 92.100.169.89 (talk) 12:19, 5 March 2013 (UTC)
- They definitely don't have to be. That said, I think the fastest way to create a beap from an existing array is simply to sort it (the beap equivalent of heapifying would require O(n√n) time, whereas sorting requires only O(n log n) time), so maybe the diagram depicts a newly-beapified array? (But, either way, certainly not the best diagram!) —RuakhTALK 07:04, 10 October 2023 (UTC)