Talk:Priority queue: Difference between revisions
Content added Content deleted
(→C prog. output?: Thanks for the explanation. + comment on 'one example') |
|||
| Line 32: | Line 32: | ||
The output of the C program seems wrong. I was expecting one copy of each item sorted in priority order? --[[User:Paddy3118|Paddy3118]] 05:31, 5 August 2011 (UTC) |
The output of the C program seems wrong. I was expecting one copy of each item sorted in priority order? --[[User:Paddy3118|Paddy3118]] 05:31, 5 August 2011 (UTC) |
||
: I have two queues, each with randomly selected 8 items and then merged, so output is a random combination of 16 items. --[[User:Ledrug|Ledrug]] 05:45, 5 August 2011 (UTC) |
: I have two queues, each with randomly selected 8 items and then merged, so output is a random combination of 16 items. --[[User:Ledrug|Ledrug]] 05:45, 5 August 2011 (UTC) |
||
::Thanks for the explanation Ledrug. --[[User:Paddy3118|Paddy3118]] 06:01, 5 August 2011 (UTC) |
|||
Is it possible to agree on a suitable example for all language implementations to follow - to aid in comparisons - and then allow implementors to do extra if they want? It could be yours; it could be something else, but one common thing to do? --[[User:Paddy3118|Paddy3118]] 06:01, 5 August 2011 (UTC) |
|||