Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Al'Adzkiya International of Computer Science and Information Technology Journal
Sulistia, Farah
Unknown Affiliation
Computer Science & IT

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Comparative Analysis of Radix Sort, Quick Sort, and Bubble Sort Algorithms in Data Sorting Based on Array Size and Time Fadhillah, Kurnia Wati; Ulga, Nandy Thaher; Oktaviansyah, Raffi Ramadhan; Sulistia, Farah; Amanda, Jeni; Jayadi, Akhmad
Al'adzkiya International of Computer Science and Information Technology (AIoCSIT) Journal Vol 6, No 2 (2025)
Publisher : Al'Adzkiya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.55311/aiocsit.v6i2.354

Abstract

An algorithm is a series of logical actions used to solve important problems in contemporary programming and data processing. The purpose of this study is to compare the time efficiency of three sorting algorithms: Bubble Sort, Radix Sort, and Quick Sort. All algorithms are used on small (10-100 elements), medium (1,000-10,000 elements), and large (more than 100,000 elements) arrays, with execution time using Java. The results show that Radix Sort and Quick Sort are generally more efficient and scalable than Bubble Sort, especially for large arrays and random or semi-sorted data. Radix Sort excels on small and medium arrays under various conditions, while Quick Sort excels on large arrays in the average and nearly sorted cases. Although Bubble Sort can be the fastest in the best case for large arrays, its performance drops drastically in the average and nearly sorted cases. In conclusion, the selection of the best sorting algorithm depends heavily on the type of input data, such as its size and the degree of initial sorting.
Co-Authors Akhmad Jayadi Amanda, Jeni Fadhillah, Kurnia Wati Oktaviansyah, Raffi Ramadhan Ulga, Nandy Thaher