Talk:Double-ended priority queue
![]() | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||
|
Stub?
editShould this article continue to remain a stub?
Jobin (talk) 13:25, 15 October 2011 (UTC)
- Hey thanks for reminding. I just now removed the template. :)
- Pratik Lahoti (talk) 15:36, 15 October 2011 (UTC)
Hello!
editAs a part of the India Education Program, I will be working on this page along with Vibhav Bhave.
Any suggestions regarding the improvement of this page will always be welcomed. PratikLahoti 09:17, 29 August 2011 (UTC)
Table for operations
editShould I make a table for the operations section? I think it will give a better look to the page. Pratik Lahoti (talk) 13:16, 11 October 2011 (UTC)
- Using two lines for such short descriptions seems overkill, but perhaps so is using a table? I never really got why browsers don't render HTML definition lists as LaTeX does. The "Complexity" section could use a table listing the asymptotic complexity of each operation for each of the different implementations, I think. —Ruud 17:34, 11 October 2011 (UTC)
Other applications
editIs it just me, or does the application described in the "Other applications" section not require a DEPQ, but rather two (single-ended) priority queues? --Sneftel (talk) 11:28, 24 June 2013 (UTC)
Pairing heaps?
editWas someone thinking of interval heaps, which are also called "pair heaps", when they wrote "pairing heap"? I can't find any way to make pairing heaps support both remove-min and remove-max, and it doesn't seem like it's possible. —Coder Dan (talk) 08:55, 18 October 2021 (UTC)
- It describes the method more in the "Implementation section". In short, there's two heaps, a remove-min entails a delete from the max-heap, and a remove-max entails a delete from the min-heap. Any heap structure with an efficient delete (or decrease-key) will work. Sneftel (talk) 21:50, 18 October 2021 (UTC)
India Education Program course assignment
editThis article was the subject of an educational assignment supported by Wikipedia Ambassadors through the India Education Program. Further details are available on the course page.
The above message was substituted from {{IEP assignment}}
by PrimeBOT (talk) on 20:14, 1 February 2023 (UTC)