Perbandingan Algoritma Simple Sorting antara Penggunaan Variabel Temporary dan Tanpa Variabel Temporary

Authors

  • Achmad Arrosyidi Universitas Dinamika
  • Didiet Anindita Arnandy Universitas Dinamika

DOI:

https://doi.org/10.37034/jsisfotek.v4i4.185

Keywords:

Algorithm, Sorting, Variable, Temporary, Comparation

Abstract

Temporary variables used in swapping technique on sorting algorithm. There are alternative swapping techniques uses pairs of + and -, × and / operators in the sorting process. This study aims to determine the duration of the sorting process uses the + and - operator pairs, the × and / operator, and the uses of temporary variables. By knowing the duration, it can determine the performance of each swapping technique. Important of this research it can contribute for advanced research or applied research. Data generated input algorithms in descending and ascending sequence. The input was sorted by 18 types of Bubble, Selection, and Insertion sort algorithm. Output sequence contrary from the data input. Duration sorting process obtained from the end processed time subtract by the start processed time. Sorting duration recapitulated to get the average duration of the sorting process so can be compared between swapping techniques. The test method has run 18 types of Simple sorting algorithms from 10, 50, and 100 data variants. frequency of each variant 10 times tests. The total data used 28,800 of integer types. Result of the average duration test that swapping uses × and / operators 306,236 milliseconds uses + and - operators 294,998 milliseconds, and swapping technique with temporary variables 294,557 milliseconds. The best performance showed by swapping technique uses temporary variables instead of uses pair of + and – operators, also used pair of × and / operators.

References

Abdel-Hafeez, S., & Gordon-Ross, A. (2017). An efficient O(N) comparison-free sorting algorithm. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 25(6), 1930–1942. https://doi.org/10.1109/TVLSI.2017.2661746

Anggreani, D., Wibawa, A. P., Purnawansyah, P., & Herman, H. (2020). Perbandingan Efisiensi Algoritma Sorting dalam Penggunaan Bandwidth. ILKOM Jurnal Ilmiah, 12(2), 96–103. https://doi.org/10.33096/ilkom.v12i2.538.96-103

Betschart, R. O., Thiéry, A., Aguilera-Garcia, D., Zoche, M., Moch, H., Twerenbold, R., Zeller, T., Blankenberg, S., & Ziegler, A. (2022). Comparison of calling pipelines for whole genome sequencing: an empirical study demonstrating the importance of mapping and alignment. BioRxiv, 2022.09.18.508404. https://doi.org/10.1038/s41598-022-26181-3

Bustami, B., Fadlisyah, F., & Alfyansyah, G. (2019). Comparison of Simple Algorithm Data (Sorting) Control Methods on Selection and Bubble Sort. TECHSI - Jurnal Teknik Informatika, 11(2), 289. https://doi.org/10.29103/techsi.v11i2.1601

Ekowati, M. A. S., Nindyatama, Z. P., Widianto, W., & Dananti, K. (2022). Comparative Analysis of the Speed of the Sorting Method on Google Translate Indonesian-English Using Binary Search. International Journal of Global Operations Research, 3(3), 108–115. https://doi.org/10.47194/ijgor.v3i3.167

Htwe Htwe Aung. (2019). Analysis and Comparative of Sorting Algorithms. Published in International Journal of Trend in Scientific Research and Development, 3(5), 1049–1053. https://doi.org/https://doi.org/10.31142/ijtsrd26575

Jmaa, Y. Ben, Atitallah, R. Ben, Duvivier, D., & Jemaa, M. Ben. (2019). A comparative study of sorting algorithms with FPGA acceleration by high level synthesis. Computacion y Sistemas, 23(1), 213–230. https://doi.org/10.13053/CyS-23-1-2999

Jones, T. B., & Ackley, D. H. (2014). Comparison criticality in sorting algorithms. Proceedings of the International Conference on Dependable Systems and Networks, 726–731. https://doi.org/10.1109/DSN.2014.74

K, M. R., & J, M. R. (2018). A Comparative Study of Sorting and Searching Algorithms. International Research Journal of Engineering and Technology (IRJET), 05(01), 1412–1416. https://doi.org/10.5539/mas.v12n4p143

Kavdikar, P. (2021). Comparative study of sorting algorithms. April. https://doi.org/10.13140/RG.2.2.30552.62724

M. Rabiu, A., J. Garba, E., Y. Baha, B., M. Malgw, Y., & Dauda, M. (2022). Performance Comparison of three Sorting Algorithms Using Shared Data and Concurrency Mechanisms in Java. Arid-Zone Journal of Basic & Applied Research, 1(1), 55–64. https://doi.org/10.55639/607fox

Pasetto, D., & Akhriev, A. (2011). A comparative study of parallel sort algorithms. SPLASH’11 Compilation - Proceedings of OOPSLA’11, Onward! 2011, GPCE’11, DLS’11, and SPLASH’11 Companion, 203–204. https://doi.org/10.1145/2048147.2048207

Raghuvanshi, D. (2018). Data Structure: Theoretical Approach. International Journal of Trend in Scientific Research and Development, Volume-3(Issue-1), 268–273. https://doi.org/10.31142/ijtsrd18977

Rajagopal, D., & Thilakavalli, K. (2016). Different Sorting Algorithm’s Comparison based Upon the Time Complexity. International Journal of U- and e- Service, Science and Technology, 9(8), 287–296. https://doi.org/10.14257/ijunesst.2016.9.8.24

Sari, N., Gunawan, W. A., Sari, P. K., Zikri, I., & Syahputra, A. (2022). Analisis Algoritma Bubble Sort Secara Ascending Dan Descending Serta Implementasinya Dengan Menggunakan Bahasa Pemrograman Java. ADI Bisnis Digital Interdisiplin Jurnal, 3(1), 16–23. https://doi.org/10.34306/abdi.v3i1.625

Setiawan, R. (2017). Comparing sorting algorithm complexity based on control flow structure. Proceedings of 2016 International Conference on Information Management and Technology, ICIMTech 2016, November, 224–228. https://doi.org/10.1109/ICIMTech.2016.7930334

Sonita, A., & Nurtaneo, F. (2016). Analisis Perbandingan Algoritma Bubble Sort, Merge Sort, Dan Quick Sort Dalam Proses Pengurutan Kombinasi Angka Dan Huruf. Pseudocode, 2(2), 75–80. https://doi.org/10.33369/pseudocode.2.2.75-80

Sunandar, E. (2019). Perbandingan Metode Selection Sort dan Insertion Sort Dalam Pengurutan Data Menggunakan Bahasa Program Java. Petir, 12(2), 172–178. https://doi.org/10.33322/petir.v12i2.485

Sunandar, E., & Indrianto, I. (2020). Implementasi Algoritma Bubble Sort Terhadap 2 Buah Model Varian Pengurutan Data Menggunakan Bahasa Program Java. Petir, 13(2), 255–265. https://doi.org/10.33322/petir.v13i2.1008

Zhao, L., Liu, X., & Shao, X. (2016). Comparative Analysis of Numerical Sorting Algorithms in Java Language. Icadme, 415–419. https://doi.org/10.2991/icadme-16.2016.68

Downloads

Published

21-12-2022

How to Cite

[1]
A. Arrosyidi and D. A. . Arnandy, “Perbandingan Algoritma Simple Sorting antara Penggunaan Variabel Temporary dan Tanpa Variabel Temporary ”, jsisfotek, vol. 4, no. 4, pp. 198–203, Dec. 2022.

Issue

Section

Articles