Comparison Analysis of Bubble Sort Algorithm with Tim Sort Algorithm Sorting Against the Amount of Data

Muhammad Rizal Hanafi, Muhammad Azfa Faadhilah, Muhammad Taufik Dwi Putra, Deden Pradeka


The role of algorithms in software or programming is so important that you need to understand the basic concepts behind them. In most of our daily life, we often face problems that need to be solved by entering the data sorting process. A lot of programming logic has been created, both in the general case and in the special case. In this study, the authors carried out the sorting process with two methods, namely bubble sort and tim sort. Sorting application is built using C++ program. Algorithms are needed in order to be able to solve a problem more effectively and efficiently in a shorter time using only a few resources. The preparation of this research uses data collection methods that aim to obtain the necessary data so that it can be extracted to be used as information. It is hoped that from this information it can be seen that the comparison of the bubble sort algorithm with the tim sort is getting better in the data sorting process, if the number of inputted data is greater than n.

Full Text:



Prabowo, R. C. (2018) ‘Penentuan Rute Distribusi Barang Yang Optimal Dengan Menggunakan Algoritma Heuristik pada PT. XYZ’, Strategy: Jurnal Teknik Industri, 3(1), pp. 47–50.

Hendra Bucika Glen Kadam, IG. Jaka Mulyana, J. M. (2018) ‘Penentuan Rute Terpendek Dengan Metode Tabu Search (Studi Kasus)’, Widya Teknik, 17(2), pp. 94–103.

Sirojul Hadi, Parama Diptya Widayaka, Radimas Putra M.D.L, R. D. (2020) ‘Pengukuran Jarak Pada Mobile Robot Menggunakan Xbee Berdasarkan Nilai Receive Signal Strength Indicator (RSSI)’, Jurnal Bumigora Information Technology (BITe), 2(1), pp. 66–70.

Barto, R. S. S. and A. G. (2018) Reinforcement Learning: An Introduction. Second. MIT press.

Laber, J. C. And E. (2020) ‘Q-Learning: Theory and Applications’, Annual Review of Statistics and Its Application, 7, pp. 279–301.

Chakrabarti, S. M. O. T. S. (2018) ‘Reinforcement learning algorithms for uncertain, dynamic, zero-sum games’, in International Conference on Machine Learning and Applications (ICMLA). IEEE, pp. 48–54.

Watkins, C. J. C. H. (1989) Learning from delayed rewards. Cambridge University.

Ghulam Muhammad Ali, Asif Mansoor, Shuai Liu, Jacek Olearczyk, A. B. and M. A.-H. (2020) ‘Attaining global optimized solution by applying Q-learning’, in International Multidisciplinary Modeling & Simulation Multiconference, pp. 112–119.


  • There are currently no refbacks.

Journal of Computer Engineering, Electronics and Information Technology (COELITE)
is published by UNIVERSITAS PENDIDIKAN INDONESIA, and managed by Department of Computer Enginering.