2013-04-10 23:57:08 -07:00
|
|
|
{{Data structure}}
|
|
|
|
|
[[File:Fifo.gif|frame|right|Illustration of FIFO behavior]]
|
2016-12-05 22:15:40 +01:00
|
|
|
|
|
|
|
|
;Task:
|
|
|
|
|
Create a queue data structure and demonstrate its operations.
|
|
|
|
|
|
|
|
|
|
(For implementations of queues, see the [[FIFO]] task.)
|
|
|
|
|
|
2013-04-10 23:57:08 -07:00
|
|
|
|
|
|
|
|
Operations:
|
2016-12-05 22:15:40 +01:00
|
|
|
::* push (aka ''enqueue'') - add element
|
|
|
|
|
::* pop (aka ''dequeue'') - pop first element
|
|
|
|
|
::* empty - return truth value when empty
|
2013-10-27 22:24:23 +00:00
|
|
|
|
2016-12-05 22:15:40 +01:00
|
|
|
<br>
|
2013-10-27 22:24:23 +00:00
|
|
|
{{Template:See also lists}}
|
2016-12-05 22:15:40 +01:00
|
|
|
<br><br>
|
