Unjuk Kerja Selection Sort Hybrid
DOI:
https://doi.org/10.24002/jbi.v11i1.2699Abstract
Abstract. Sorting is the most basic and important process in data processing. The sorting process on large data causes large computation. Some existing sorting algorithms need to be improved to further improve their performance. This study tried to develop an existing selection sort algorithm, into a selection sort hybrid algorithm that is expected to have better performance. Selection sort hybrid algorithm is an algorithm that combines both minimum and maximum searching techniques. It can find minimum and maximum values in the same time to sort from the both side of the data. Since it can be done separately, multithreading is used to do this job. So the sorting process can be done simultaneously. Several tests using different amounts of data have been conducted to compare the performance of the algorithms. The result is selection sort hybrid algorithm more efficient than the origin selection sort. Henceforth, the result obtained from the research can be used for various purposes related to data processing in informatics area.
Keywords: sorting, selection sort, selection sort hybrid, computing
Abstrak. Sorting atau pengurutan adalah proses yang paling mendasar dan penting dalam pemrosesan data. Proses pengurutan pada data yang besar menyebabkan komputasi menjadi tinggi. Maka beberapa algoritme pengurutan perlu ditingkatkan kinerjanya. Penelitian ini mencoba mengembangkan algoritme selection sort, menjadi algoritme selection sort hybrid yang diharapkan memiliki kinerja yang lebih baik. Algoritme selection sort hybrid adalah algoritme yang menggabungkan teknik pencarian minimum dan maksimum. Algoritme tersebut dapat menemukan nilai minimum dan maksimum dalam waktu yang bersamaan untuk mengurutkan data dari kedua sisinya. Karena dapat dikerjakan secara terpisah, maka teknik multithreading digunakan untuk melakukan pekerjaan ini. Jadi proses pengurutan data bisa dilakukan secara simultan. Beberapa pengujian menggunakan jumlah data yang berbeda telah dilakukan untuk membandingkan kinerja kedua algoritme ini. Hasilnya adalah algoritme selection sort hybrid lebih efisien daripada algoritme selection sort untuk semua kasus yang diberikan. Diharapkan hasil yang diperoleh dari penelitian ini dapat digunakan untuk berbagai keperluan terkait dengan pengolahan data di bidang informatika.
Kata kunci: Pengurutan, selection sort, selection sort hybrid, komputasi
References
K. Jouper dan H. Nordin, “Performance Analysis of Multithreaded Sorting Algorithms,” Thesis, Blekinge Institute of Technology, 2015.
M. T. Goodrich, R. Tamassia dan M. H. Goldwasser, Data Structure & Algorithms in Java Sixth Edition, United States of America: John Wiley & Sons, Inc., 2014.
P. Hyde, Java Thread Programming, Indianapolis: SAMS, 1999.
V. P. Kulalvaimozhi, M. Muthulakshmi, R. Mariselvi, G. S. Devi, C. Rajalakshmi dan C. Durai
, Performance analysis of sorting algorithm, International Journal of Computer Science and Mobile Computing (IJCSMC), Vol 4(1), pp. 291-306, 2015.
K. S. Al-Kharabsheh, I. M. AlTurani, A. M. I. AlTurani dan N. I. Zanoon, Review on sorting algorithms a comparative study, International Journal of Computer Science and Security (IJCSS), Vol. 7(3), pp. 120-126, 2013.
D. Rajagopal dan K. Thilakavalli, Different sorting algorithm’s comparison based upon the time complexity, International Journal of u- and e- Service, Science and Technology, Vol. 9(8), pp. 287-296, 2016.
N. Akhter, M. Idrees dan F. Rehman, Sorting algorithms – a comparative study, International Journal of Computer Science and Information Security (IJCSIS), Vol. 14(12), pp. 930-936, 2016.
J. Alnihoud and R. Mansi, An enhancement of major sorting algorithms, The International Arab Journal of Information Technology, Vol. 7(1), pp. 55-61, 2010.
J. B. Hayfron-Acquah dan O. Appiah, Improved selection sort algorithm, International Journal of Computer Applications, Vol. 110(5), pp. 29-33, 2015.
M. Khairullah, Enhancing worst sorting algorithms, International Journal of Advanced Science and Technology, Vol. 56, pp. 13-26, 2013.
S. Majumdar, I. Jain and A. Gawade, Parallel quick sort using thread pool pattern, International Journal of Computer Applications, Vol. 136(7), pp. 36-41, 2016.
H. M. Deitel and P. J. Deitel, Java: How to Program 8th Edition, Pearson: London, 2009.
Downloads
Published
Issue
Section
License
Copyright of this journal is assigned to Jurnal Buana Informatika as the journal publisher by the knowledge of author, whilst the moral right of the publication belongs to author. Every printed and electronic publications are open access for educational purposes, research, and library. The editorial board is not responsible for copyright violation to the other than them aims mentioned before. The reproduction of any part of this journal (printed or online) will be allowed only with a written permission from Jurnal Buana Informatika.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
