Bubble Sort and Quick Sort Algorithm Performance on Flutter Framework and Dart SDK(E-Commerce Application Case Study)
Abstract
Sorting data is one of the techniques in data structures, and data structures certainly have various algorithms. In e-commerce applications, really need a good and efficient data sorting algorithm in terms of speed performance and also the accuracy of data sorting accuracy. In this study, the performance of the data sorting algorithm was tested, namely the Bubble Sort and Quick Sort algorithms where the supporting media for the test was an e-commerce application built with the Flutter framework and the Dart programming language. The dataset used was obtained from Optik Citra Abadi and Tokopedia's official store, namely Optik Melawai, Optik Kasoem, and Optik Seis. The test results of the two algorithms which have been divided into 5 iterations and 10 times of data retrieval from each iteration show that there is a difference in execution time for 250 data lengths, where the bubble sort algorithm takes 0.468421 seconds, while the quick sort algorithm only takes 0.008912 seconds. Both algorithms obtain 100% accuracy in the data sorting process.
References
Eko Saputro, F., Nidaul Khasanah, F. 2018. Teknik Selection Sort dan Bubble Sort Menggunakan Borland C++. Jurnal Mahasiswa Bina Insani. No.2, Vol.2, 136–145.
Putra, T. A., dan Santoso, Y. (n.d.). Implementasi E-Commerce Sebagai Media Penjualan Online pada Toko Tatashops. Jurnal IDEALIS. No.6, Vol.2, 408-413.
Rahayuningsih, P. 2016. Analisis Perbandingan Kompleksitas Algoritma Pengurutan Nilai (Sorting). Jurnal Evolusi. 4, 64–75.
Anggreani, D., Wibawa, A. P., Purnawansyah, P., dan Herman, H. 2020. Perbandingan Efisiensi Algoritma Sorting dalam Penggunaan Bandwidth. ILKOM Jurnal Ilmiah. No.12, Vol.2, 96–103.
Sunandar, E. 2019. Perbandingan Metode Selection Sort dan Insertion Sort dalam Pengurutan Data Menggunakan Bahasa Program Java. Jurnal Pengkajian dan Penerapan Teknik Informatika. No.12, Vol.2, 172-178.
Arifin, R. W., dan Setiyadi, D. 2020. Algoritma Metode Pengurutan Bubble Sort dan Quick Sort Dalam Bahasa Pemrograman C++. Information System For Educators and Professionals. No.4, Vol.2, 178–187.
Rumapea, Y. Y. P. 2017. Analisis Perbandingan Metode Algoritma Quick Sort dan Merge Sort dalam Pengurutan Data Terhadap Jumlah Langkah dan Waktu. Jurnal Methodika. No.2, Vol.3, 5-9.
Situmorang, H. 2016. Simulasi Pengurutan Data dengan Algoritma Heap Sort. Jurnal Mahajana Informasi. No.1, Vol.2, 20-30.
Faiza Hakim, Z. 2017. Implementasi Metode Selection Sort Untuk Menentukan Barang Yang Harus Di Stok Ulang Dalam Sistem Informasi Penjualan. Journal Information Engineering and Educational Technology. No. 01, Vol.01, 19-26.
Setyantoro, D., dan Hasibuan, R. A. 2020. Analisis dan Perbandingan Kompleksitas Algoritma Exchange Sort dan Insertion Sort untuk Pengurutan Data menggunakan Python. Tekinfo. No.1, Vol.21, 48-56.
Pane, H., Fauziah, dan Nurhayati. 2018. Rancang Bangun Aplikasi Kraepelin Test Berbasis Web Menggunakan Metode Bubble Sort. Journal of Information Technology and Computer Science.No.1, Vol.3, 41-48.
Pratama, M. A., Desiani, A., dan Irmeilyana. 2017. Analisis Kebutuhan Waktu Algoritma Insertion Sort, Merge Sort, dan Quick Sort dengan Kompleksitas Waktu. In Computer Science and ICT. No.1, Vol.1, 31-34.
Rizkyatul Basir, R. 2020. Analisis Kompleksitas Ruang dan Waktu Terhadap Laju Pertumbuhan Algoritma Heap Sort, Insertion Sort dan Merge dengan Pemrograman Java. Satuan Tulisan Riset dan Inovasi Teknologi. No.2, Vol.5, 109-118.
Gunawan, I., Heru, dan Satria Tambunan, H. 2019. Penggunaan Algoritma Sorting Bubble Sort untuk Penentuan Nilai Prestasi Siswa. In Jurnal Sistem Informasi. No.2, Vol.8, 296-304.
Abdulla, M. 2017. Empirical Comparison Between Classical Quicksort and an Enhanced Time Optimal Quicksort. International Research Journal of Mathematics, Engineering and IT. No.1, Vol, 4, 21-33.
Dzulfiqar Iskandar, I., Amirulloh, I., Winda Pertiwi, M., Kusmira, M., Baitul Hikmah, A., dan Supriadi, D. 2020. Analysis of Bubble Sort and Insertion Sort Algorithm on Memory Efficiency Using Data Mining Approach. Jurnal PILAR Nusa Mandiri.No.1, Vol.16, 89-96.
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
JATIS oleh http://jurnal.mdp.ac.id/index.php/jatisi disebarluaskan di bawah Lisensi Creative Commons Atribusi-BerbagiSerupa 4.0 Internasional.
