Comparison of Efficiency Data Sorting Algorithms Based on Execution Time

Authors

  • Achmad Fitro  Department of Computer Technology, NSC Polytechnic, Surabaya, Indonesia

DOI:

https://doi.org//10.32628/CSEIT2390151

Keywords:

Data Sorting Algorithm, MATLAB Programming Language, Efficiency, Execution Time

Abstract

In today's era, the development of information technology is increasingly rapid. This is because human life is currently very dependent on the needs of information technology. This can be proven by the number of human interactions with various gadgets, such as laptops, cellphones, computers, and so on. The development of information technology has made IT activists such as companies and programmers compete in making good applications. One of the most basic things that are mastered in making an application is making algorithms. Currently, there are many types of algorithms. One of them is the data sorting algorithm. In this study, we will try to examine 3 data sorting algorithms, namely Insertion Sort, Quick Sort, and Merge Sort. These three algorithms will be used to sort random data ranging from 1000 to 20,000 data. The three algorithms will be compared in terms of execution time. The results show that the Insertion Sort algorithm is a data sorting algorithm that has the fastest execution time compared to other algorithms, while the Merge Sort algorithm is the most time consuming algorithm compared to other algorithms.

References

  1. Charlie and A. R. Yohanis, “Game Application For Learning Bubble Sort Algorithm,” Kalbiscentia  J. Sains dan Teknol., vol. 3, no. 2, pp. 24–38, 2016.
  2. P. Palvia, J. Ghosh, T. Jacks, and A. Serenko, “Information technology issues and challenges of the globe: the world IT project,” Inf. Manag., vol. 58, no. 8, p. 103545, 2021, doi: https://doi.org/10.1016/j.im.2021.103545.
  3. S. GUPTA, A. KAUSHIK, C. THIEMAN, and M. PADOMEK, “SIGNIFICANT REDUCTION IN CARBAPENEM AND FLUOROQUINOLONE USE WITH IMPLEMENTATION OF MULTIFACETED ANTIBIOTIC STEWARDSHIP PROGRAM (ASP) INTERVENTIONS,” Chest, vol. 160, no. 4, Supplement, p. A1070, 2021, doi: https://doi.org/10.1016/j.chest.2021.07.990.
  4. A. F. Rudianto and R. Fauzan, “Application for Calculating Psychological Pressure in the DASS (Depression, Anxiety, and Stress Scale) Scale Using the Certainty Factor Method,” Computer (Long. Beach. Calif)., vol. 1, p. 2.
  5. Y. Wang, K. S. Cheng, M. Song, and E. Tilevich, “A declarative enhancement of JavaScript programs by leveraging the Java metadata infrastructure,” Sci. Comput. Program., vol. 181, 2019, doi: 10.1016/j.scico.2019.05.005.
  6. D. Weragama and J. Reye, “Analysing student programs in the PHP intelligent tutoring system,” Int. J. Artif. Intell. Educ., vol. 24, no. 2, 2014, doi: 10.1007/s40593-014-0014-z.
  7. A. Triyadin, I. S.Pd., M.PFis, and Z. Zulkarnain, “THE INFLUENCE OF THE MATLAB PROGRAM-BASED CONTEXTUAL TEACHING AND LEARNING (CTL) LEARNING MODEL ON STUDENTS’ LEARNING OUTCOMES IN CLASS VIII MATERIAL OF SMPN 3 NARMADA 2020/2021,” ORBITA J. Kajian, Inov. dan Apl. Pendidik. Fis., vol. 6, no. 2, 2020, doi: 10.31764/orbita.v6i2.3364.
  8. G. G. Maulana, “LEARNING BASIC ALGORITHMS AND PROGRAMMING USING WEB-BASED EL-GORITHMS,” J. Tek. Mesin, vol. 6, no. 2, 2017, doi: 10.22441/jtm.v6i2.1183.
  9. P. A. Rahayuningsih, “Comparative Analysis of the Complexity of the Sorting Algorithms (Shorting),” J. Evolusi, vol. 4, no. 2, 2016.
  10. A. A. Jabar and A. S. Anas, “Desktop Based Sorting Algorithm Interactive Learning Application,” JTIM  J. Teknol. Inf. dan Multimed., vol. 1, no. 1, 2019, doi: 10.35746/jtim.v1i1.10.
  11. I. Gunawan, S. Sumarno, and H. S. Tambunan, “Use of Sorting Bubble Sort Algorithm for Determining Student Achievement Values,” SISTEMASI, vol. 8, no. 2, p. 296, May 2019, doi: 10.32520/stmsi.v8i2.493.
  12. E. Sunandar and I. Indrianto, “Implementation of the Bubble Sort Algorithm for 2 Variant Models of Data Sorting Using the Java Program Language,” PETIR, vol. 13, no. 2, 2020, doi: 10.33322/petir.v13i2.1008.
  13. N. Rathi, “QSort– Dynamic Pivot in Original Quick Sort,” Int. J. Adv. Res. Dev., vol. 3, no. 7, 2018.
  14. W. T. Saputro, “Quick Sort Algorithm Complexity To Find Time And Memory Efficiency,” INTEK J. Inform. dan Teknol. Inf., vol. 1, no. 1, pp. 1–6, 2018.
  15. A. S. Mohammed, Ş. E. Amrahov, and F. V. Çelebi, “Bidirectional Conditional Insertion Sort algorithm; An efficient progress on the classical insertion sort,” Futur. Gener. Comput. Syst., vol. 71, 2017, doi: 10.1016/j.future.2017.01.034.
  16. E. Retnoningsih, “Data Sorting Algorithm with Insertion Sort and Selection Sort Methods,” Inf. Manag. Educ. Prof., vol. 3, no. 1, 2018.
  17. R. Maulana, “Comparative Analysis of the Complexity of the Sorting Algorithms,” Informatika, vol. 3, no. September, 2016.
  18. J. Lobo and S. Kuwelkar, “Performance Analysis of Merge Sort Algorithms,” 2020, doi: 10.1109/ICESC48915.2020.9155623.
  19. M. Yusman, A. Aristoteles, and A. R. Irawati, “PARALLEL AND SERIAL COMPUTATION ANALYSIS OF MERGE SORT ALGORITHM,” J. Sains MIPA, vol. 18, no. 1, 2012.
  20. D. Anggreani, A. P. Wibawa, P. Purnawansyah, and H. Herman, “Comparison of Sorting Algorithm Efficiency in Bandwidth Usage,” Ilk. J. Ilm., vol. 12, no. 2, pp. 96–103, 2020, doi: 10.33096/ilkom.v12i2.538.96-103.
  21. M. R. Maulana, “Comparison of Sorting Algorithms in the Java Programming Language,” IC-Tech, vol. 12, no. 2, 2017.

IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology

Downloads

Published

2023-03-30

Issue

Volume 9, Issue 2, March-April-2023

Section

Research Articles

License

Copyright (c) IJSRCSEIT

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
Achmad Fitro, " Comparison of Efficiency Data Sorting Algorithms Based on Execution Time, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 9, Issue 2, pp.15-21, March-April-2023. Available at doi : https://doi.org/10.32628/CSEIT2390151