原书出处
Introduction to Algorithms, Fourth Edition
10 第10章 基本数据结构
eue reside in locations Q.head, Q.head + 1, … , Q.tail – 1, where we “wrap around” in the
sense that location 1 immediately follows location n in a circular order. When Q.head = Q.tail, the queue is empty. Initially, we have Q.head = Q.tail = 1. An attempt to dequeue an element from an empty queue causes the queue to underflow. When
Q.head = Q.tail + 1 or both Q.head = 1 and Q.tail = Q.size, the queue is full, and an att
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter010.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea