c 队列实现队伍简介.doc（c 队列实现队伍简介.doc）.docVIP

c 队列实现队伍简介.doc（c 队列实现队伍简介.doc） C++ queue implementation and queue profile (2006-8-23, 17:27:00) [collection] [comment] [Print] [off] Tags: data structures, C++ queues Queue profile: Queue (Queue) is a data structure that inserts elements at one end of a queue and removes elements at the other end of the queue. (1) the deleted end is called the Front. (2) the end allowed to be inserted is called the tail (Rear). (3) when there is no element in the queue, it is called an empty queue. (4) queues are also called linear Out In First (First FIFO) tables, referred to as FIFO tables. The modification of the queue is based on the FIFO principle. The new members of the team (which is always added tail does not allow delayed), a member of every time I leave the queue always on the head (not allowed to leave half-way, namely current) the old members leave. A multitasking system is a typical queue example in which job scheduling is completed. Suppose there are five programs waiting to be executed, they will be put into a queue, and if sixth programs are to be executed, it will be placed at the end of the queue. The first program in the queue is executed first. Queue implementation: * (1) initQueue (Q); Empty team. Construct an empty queue Q. (2) isEmpty (Q); Determine whether the queue is empty. If the queue Q is empty, return the truth value, otherwise the false value is returned. (3) isFull (Q); Determines whether the queue is full, returns true with full, and returns flase when not full (4) addQueue (Q, x); If the queue Q is not full, insert the element x into the tail of the Q. This operation is referred to as the team. (5) DelQueue (Q); If the queue Q is not empty, the Q header element is deleted and the element is returned. This operation is referred to as the team. (6) queueFront (Q); If the queue Q is not empty, the header element is returned, but the status of the queue Q is not changed. (7) queueDisplay (Q); Display elements in a queue. * / #include iostream.h #define