Comparative Analysis of Numerical Sorting Algorithms in Java Language

DOI

10.2991/icadme-16.2016.68How to use a DOI?

Keywords

Internal sorting; Time complexity; Stability

Abstract

Sorting is one of the important algorithms in computer programming. The ordinary 6 sorting algorithms are analyzed and compare from the algorithmic time complexity and stability. The executive efficiency of 6 sorting algorithms is verified by Java program. The costing time and stability of 6 sorting algorithms are compared to provide certain reference for sorting algorithm.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Lingling Zhao
AU  - Xuemei Liu
AU  - Xiufeng Shao
PY  - 2017/07
DA  - 2017/07
TI  - Comparative Analysis of Numerical Sorting Algorithms in Java Language
BT  - Proceedings of the 2016 6th International Conference on Advanced Design and Manufacturing Engineering (ICADME 2017)
PB  - Atlantis Press
SP  - 415
EP  - 419
SN  - 2352-5401
UR  - https://doi.org/10.2991/icadme-16.2016.68
DO  - 10.2991/icadme-16.2016.68
ID  - Zhao2017/07
ER  -