Jump to content

Talk:Beap

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

beap

[edit]

Who is William? --Abdull 17:55, 6 March 2006 (UTC)[reply]

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?

[edit]

The diagram in the article suggests that they do. - 92.100.169.89 (talk) 12:19, 5 March 2013 (UTC)[reply]

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(nn) 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)[reply]