Abstract
Analyzed and introduced the sequential storage structure of the queue, detailed analyzed several specific methods for the circular queue to resolve the “false overflow”, gave the algorithm descriptions in C of the corresponding basic operations of the queue, compared and analyzed each algorithm the time complexity and the space complexity, so as to complement and play a guiding role in the relevant chapters in “Data Structure” curriculum.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Yan, W., Wu, W.: Data Structures (C language edition). Tsinghua University Press, Beijing (2002)
Geng, G.: Data Structure—C Language description. Xi’an Electronic Science and Technology University Press, Xi’an (2005)
Wang, Z.: Data Structure. Xi’an Jiaotong University Press, Xi’an (2003)
Gong, S., Ren, Y., Chen, W.: The Front and Rear Pointer Design of Circular Queue. J. Modern Computer 253, 17–20 (2007)
Qiu, D.: Algorithm of Deciding the Circular Queue is Empty or Full. J. Computer Development & Applications 11, 61 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, M. (2011). Analysis on Realization of Sequential Queue. In: Shen, G., Huang, X. (eds) Advanced Research on Electronic Commerce, Web Application, and Communication. ECWAC 2011. Communications in Computer and Information Science, vol 144. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20370-1_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-20370-1_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20369-5
Online ISBN: 978-3-642-20370-1
eBook Packages: Computer ScienceComputer Science (R0)