With giving the design ideas and the algorithm descriptions in C, the binary tree selection sort algorithm is analyzed and introduced in detail. After the time complexity and the space complexity of the algorithms being analyzed in this paper, the binary tree selection sort algorithm is compared with the simple selection sort algorithm. This paper provides a theoretical basis on algorithm optimization.
| Published in |
Pure and Applied Mathematics Journal (Volume 4, Issue 5-1)
This article belongs to the Special Issue Mathematical Aspects of Engineering Disciplines |
| DOI | 10.11648/j.pamj.s.2015040501.20 |
| Page(s) | 51-54 |
| Creative Commons |
This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited. |
| Copyright |
Copyright © The Author(s), 2016. Published by Science Publishing Group |
Binary Tree Selection Sort, Time Complexity, Space Complexity
| [1] | Wang Weidong, Data Structure Learning guidance. Xi'an Electronic Science and Technology University Press, Xi'an (2004). |
| [2] | Min Wang and Yunfei Li, “Designing on a Special Algorithm of Triple Tree Based on the Analysis of Data Structure”, International Conference on Computer Education, Simulation and Modeling (CESM 2011), Proceedings, Part I (Communications in Computer and Information Science), 423-427. |
| [3] | Geng Guohua, Data Structure—C Language Description, Xi'an: Xi'an Electronic Science and Technology University Press, China, (2006), 228-241. |
| [4] | Wang Min, “Analysis on 2-Element Insertion Sort Algorithm”, 2010 International Conference on Computer Design and Applications (ICCDA 2010), Volume 1, Session 1-C: Computer Theory, 143-145. |
| [5] | Xu Xiaokai. Simple Data Structure Tutorial. Tsinghua University Press, Beijing, (1995), 193–196. |
| [6] | Xu Xusong. Introduction to Data Structures and Algorithms. Electronics Industry Press, Beijing, (1996), 162–164. |
| [7] | Yan Weimin and Wu Weimin, Data Structures(C Language Edition), Beijing: Tsinghua University Press, China, (2002), 263-278. |
| [8] | Wang Min, “Analysis on bubble sort algorithm optimization”, 2010 International Forum on Information Technology and Applications (IFITA 2010), Volume 1,Section A: Theory and Method of Information Technology, 208-211. |
| [9] | Jiang Min, “Bilateral selectsort algorithm”, vol. 5. No. 1. Journal of Taizhou Polytechnical Institute, (2005), 60-62. |
| [10] | Wang Min, “Design and analysis on bidirectional selection sort algorithm”, International Conference on Education Technology and Computer, Volume 4(2010), 380-383. |
| [11] | Liang Wenzhong, “An improved assumption based on straight selection sorting”, vol.21. No.4. Journal of Guangxi Teachers Education University (Natural Science Edition), (2004), 93-96. |
| [12] | Zhang Yiwen and Tan Ji, “Analysis and improvement on simple selection sort algorithm”, No.18. Silicon Valle, (2009), 77-94. |
APA Style
Wang Min, Li Yaolong. (2016). Optimization and Analysis on Binary Tree Selection Sort Algorithm. Pure and Applied Mathematics Journal, 4(5-1), 51-54. https://doi.org/10.11648/j.pamj.s.2015040501.20
ACS Style
Wang Min; Li Yaolong. Optimization and Analysis on Binary Tree Selection Sort Algorithm. Pure Appl. Math. J. 2016, 4(5-1), 51-54. doi: 10.11648/j.pamj.s.2015040501.20
Share This Article
Twitter
Linked In
Facebook
Copy
Download@article{10.11648/j.pamj.s.2015040501.20,
author = {Wang Min and Li Yaolong},
title = {Optimization and Analysis on Binary Tree Selection Sort Algorithm},
journal = {Pure and Applied Mathematics Journal},
volume = {4},
number = {5-1},
pages = {51-54},
doi = {10.11648/j.pamj.s.2015040501.20},
url = {https://doi.org/10.11648/j.pamj.s.2015040501.20},
eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.pamj.s.2015040501.20},
abstract = {With giving the design ideas and the algorithm descriptions in C, the binary tree selection sort algorithm is analyzed and introduced in detail. After the time complexity and the space complexity of the algorithms being analyzed in this paper, the binary tree selection sort algorithm is compared with the simple selection sort algorithm. This paper provides a theoretical basis on algorithm optimization.},
year = {2016}
}
TY - JOUR T1 - Optimization and Analysis on Binary Tree Selection Sort Algorithm AU - Wang Min AU - Li Yaolong Y1 - 2016/01/13 PY - 2016 N1 - https://doi.org/10.11648/j.pamj.s.2015040501.20 DO - 10.11648/j.pamj.s.2015040501.20 T2 - Pure and Applied Mathematics Journal JF - Pure and Applied Mathematics Journal JO - Pure and Applied Mathematics Journal SP - 51 EP - 54 PB - Science Publishing Group SN - 2326-9812 UR - https://doi.org/10.11648/j.pamj.s.2015040501.20 AB - With giving the design ideas and the algorithm descriptions in C, the binary tree selection sort algorithm is analyzed and introduced in detail. After the time complexity and the space complexity of the algorithms being analyzed in this paper, the binary tree selection sort algorithm is compared with the simple selection sort algorithm. This paper provides a theoretical basis on algorithm optimization. VL - 4 IS - 5-1 ER -
Email: