Abstract
Sorting is the basic problem of computer science. After the introduction of four bubble sorting algorithm: traditional, marked flag, two-way bubble and alternate, the time and space complexity of these algorithms were summarized. They are all O(n 2) and O(1). The performances of these algorithms were verified by programming. The result was that non-traditional sorting algorithms were time cost-less than traditional when the random degree of input sequence was low, otherwise the traditional was time cost-less. The experiment shows three approximate relationships. One is four algorithms’ time cost and input scale could be characterized by an exponential curve. The second is the traditional algorithm’s time cost and random degree could be described by a horizontal line. The last is the non-traditional algorithms’ time cost and random degree could be depicted by a line with the slope of 40º.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Knuth D. E. The Art of Computer Programming—Sorting and Searching. Addison Wesley Publishing Company, Inc., 1973, 3:145–158.
Iraj H., Afsari M. H. S., Hassanzadeh S. A New External Sorting Algorithm with Selecting the Record List Location. USEAS Transactions on Communications. 2006,5(5):909–913.
Debosiewicz W. An Efficient Variation of Bubble Sort. Information Processing Letters. 1980, 11(1):5–6.
Min W. Analysis on Bubble Sort Algorithm Optimization. 2011 International Forum on Information Technology and Applications (IFITA), 18-18 July, 2010. Kunming China,1:208–211.
Kin-Man Chung, Luccio F., Wong C. K. On the Complexity of Sorting in Magnetic Bubble Memory Systems. IEEE Transactions on Computers. 1980. C-29(7):553–563.
David R. Barstow. Remarks on “A Synthesis of Several Sorting Algorithms” by John Darlington. Acta Informatica, 1980, 13(3):225–227.
Robert Hermann. A ‘geometric’ view of the dynamics of trajectories of computer programs. Acta Applicandae Mathematicae. 2009, 18(2):145–182.
Acknowledgments
This work is partially supported by Researching Fund of Chongqing Teaching Bureau (KJ100623) to Ping Y. and Doctor Fund of Chongqing Normal University (10XLB006) to You Y.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag London Limited
About this paper
Cite this paper
Yu, P., Yang, Y., Gan, Y. (2012). Experiment Analysis on the Bubble Sort Algorithm and Its Improved Algorithms. In: Zhu, R., Ma, Y. (eds) Information Engineering and Applications. Lecture Notes in Electrical Engineering, vol 154. Springer, London. https://doi.org/10.1007/978-1-4471-2386-6_13
Download citation
DOI: https://doi.org/10.1007/978-1-4471-2386-6_13
Publisher Name: Springer, London
Print ISBN: 978-1-4471-2385-9
Online ISBN: 978-1-4471-2386-6
eBook Packages: EngineeringEngineering (R0)