《数据结构与算法》Chap5queue.pptVIP

The first program contains the data structure declarations and a list of the prototypes for all of the functions. We then develop the C code for the algorithms discussed in Section 4.2 * The linked list implementation is very popular, but it is not the only way to implement a queue. Queues can also be implemented in arrays When we implement a queue in an array, we use indexes rather than pointers. * each enqueue stores the queue data in the next element after the current queue rear As an element is deleted from the queue, the queue front is advanced to the next location: that is, queue front becomes queue front plus 1 * * * A more efficient alternative is to use a circular array. In a circular array, the last element is logically followed by the first element. This is done by testing for the last element and rather than adding 1, setting the index to 0 * With this understanding of a circular queue, we are ready to rewrite the abstract data type. The only difference in the calling sequence between the two implementations is the addition of an optional maximum queue size when the queue is instantiated. * The data structure requires two changes for the queue object. We need to store the address of the queue array, which we allocate from dynamic memory. We also need to store the maximum number of elements in the array. * * Single-server queue can provide service to only one customer at a time. Multi-server queues, on the other hand, can provide service to many customers at a time. Customer is any person or thing needing service. Service is any activity needed to accomplish the required result. Arrival rate, the rate at which customers arrive in the queue for service is known as the arrival rate. Service time is the average time required to complete the processing of a customer request. * We develop two queue applications. The first shows how to use a queue to categorize data. The second is a queue simulator, which is an excellent tool to simulate th