Talk:Beap

	This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles
???	This article has not yet received a rating on the project's importance scale.

Computer science Low‑importance

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

Low

This article has been rated as Low-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

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(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!) —Ruakh_TALK 07:04, 10 October 2023 (UTC)[reply]