Perbandingan Efisiensi Algoritma Sorting dalam Penggunaan Bandwidth


Desi Anggreani(1*); Aji Prasetya Wibawa(2); Purnawansyah Purnawansyah(3); Herman Herman(4);

(1) Universitas Negeri Malang
(2) Universitas Negeri Malang
(3) Universitas Muslim Indonesia
(4) Universitas Muslim Indonesia
(*) Corresponding Author

  

Abstract


The most used algorithm is the sorting algorithm. There have been many popping sorting algorithms that can be used, in this study researchers took three sorting algorithms namely Insertion Sort, Selection Sort, and Merge Sort. As for this study will analyze the comparison of execution time and memory usage by considering the number of enter data of each algorithm used. The data used in this study is ukhuwah NET network bandwidth usage data connected in the Faculty of Computer Science in the form of double data types. After implementing and analyzing in terms of execution time merge sort algorithm has a faster execution time in sorting data with an average execution time value of 108.593777 ms on the 3000 data count. While in the same amount of data for the most execution time is the Selection Sort algorithm with a large execution time of 144.498144 ms, in terms of memory usage with the amount of data3000 Merge Sort Algorithm has the highest memory usage compared to the other two algorithms which is 21,444 MB while the other two algorithms have a succession of memory usage of 20,837 MB and 20,325MB.

Keywords


Insertion Sort;Selection Sort;Merge Sort;Execution Time; Memory Usage

  
  

Full Text:

PDF
  

Article Metrics

Abstract view: 2189 times
PDF view: 646 times 		     

Digital Object Identifier

doi  https://doi.org/10.33096/ilkom.v12i2.538.96-103 		  

Cite

How to cite item

References


D. Kumalasari, “Analisis Perbandingan Kompleksitas Algoritma Bubble Sort, Cocktail Sort dan Comb Sort dengan Bahasa Pemrograman C ++,” J. Speed, vol. 9, no. 2, pp. 1–7, 2017.

R. Rio Sitepu, M. Yusman, and F. Eka Febriansyah, “Implementasi Algoritma Bubble Sort Dan Selection Sort Menggunakan Arraylist Multidimensi Pada Pengurutan Data Multi Prioritas,” J. Komputasi, vol. 5, no. 1, pp. 81–87, 2017.

S. K. Neelam Yadav, “Sorting Algorithms,” Int. Res. J. Eng. Technol., vol. 3, pp. 425–446, 2016.

N. Fadhillah, Huzain Azis, and D. Lantara, “Validasi Pencarian Kata Kunci Menggunakan Algoritma Levenshtein Distance Berdasarkan Metode Approximate String Matching,” Pros. Semin. Nas. Ilmu Komput. dan Teknol. Inf., vol. 3, no. 2, pp. 3–7, 2018.

P. Prajapati, N. Bhatt, and N. Bhatt, “Performance Comparison of Different Sorting Algorithms,” vol. VI, no. Vi, pp. 39–41, 2017.

W. Ali, T. Islam, H. U. R. Rehman, I. Ahmad, M. Khan, and A. Mahmood, “Comparison of different sorting algorithms,” Int. J. Adv. Res. Comput. Sci. Electron. Eng., vol. 5, no. 7, pp. 63–71, 2016.

S. Subandijo, “Efisiensi Algoritma dan Notasi O-Besar,” ComTech Comput. Math. Eng. Appl., vol. 2, no. 2, p. 849, 2017.

A. Nugroho, “Pengenalan algoritma pemrograman melalui simulasi robot,” UPN ”Veteran” Yogyakarta, vol. 2015, no. November, pp. 1–7, 2015.

M. Jauhari, D. Hamidin, and M. Rahmatuloh, “Komparasi Stabilitas Eksekusi Kode Bahasa Pemrogrman .Net C# Versi 4.0.3019 Dengan Google Golang Versi 1.4.2 Menggunakan Algoritma Bubble Sort dan Insertion Sort,” vol. 9, no. 1, pp. 13–20, 2017.

A. H. Saptadi and D. W. Sari, “Analisis Algoritma Insertion Sort, Merge Sort Dan Implementasinya Dalam Bahasa Pemrograman C++,” J. INFOTEL - Inform. Telekomun. Elektron., vol. 4, no. 2, p. 10, 2016.

M. Arawin, “Penerapan bubble sort dan insertion sort pada urutan mahasiswa,” 2018.

T. SinghSodhi, S. Kaur, and S. Kaur, “Enhanced Insertion Sort Algorithm,” Int. J. Comput. Appl., vol. 64, no. 21, pp. 35–39, 2013.

F. E. Saputro and F. N. Khasanah, “Teknik Selection Sort dan Bubble Sort Menggunakan Borland C ++,” J. Mhs. Bina Insa., vol. 2, no. 2, pp. 136–145, 2018.

S. Jadoon, S. Solehria, and M. Qayum, “Optimized Selection Sort Algorithm is faster than Insertion Sort Algorithm: a Comparative Study,” Int. J. Electr. …, no. April, 2011.

G. S. A.Kumar, A.Dutt, “Merge Sort Algorithm [M1],” Commun. ACM, vol. 15, no. 5, pp. 357–358, 2014.

S. Paira, S. Chandra, and S. K. S. Alam, “Enhanced Merge Sort- A New Approach to the Merging Process,” Procedia Comput. Sci., vol. 93, no. September, pp. 982–987, 2016.


Refbacks

  • There are currently no refbacks.


Copyright (c) 2020 Desi Anggreani, Aji Prasetya Wibawa, Purnawansyah Purnawansyah, Herman Herman

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