[Home]
[Edit this page]
[Recent Changes]
[Special Pages]
[Help]
Queue
Simulated using an array and two pointers (one for each end) or a linked list. Linked lists work better for larger queues or queues that will run for a long time because an array will run out of elements as items are enqueued and dequeued over time. Another solution to this is circular queues, where the queue wraps round the array.
[Edit this page] [Page history] [What links here] [Discuss this topic] [Printer Friendly]
Queue
(Computer science) Queue
A FIFO data structure where data is put on at one end and taken off the other. It's just like a queue in real life; you join the back and leave at the front.Simulated using an array and two pointers (one for each end) or a linked list. Linked lists work better for larger queues or queues that will run for a long time because an array will run out of elements as items are enqueued and dequeued over time. Another solution to this is circular queues, where the queue wraps round the array.
[Edit this page] [Page history] [What links here] [Discuss this topic] [Printer Friendly]
