Comparative Analysis of the Speed of the Sorting Method on Google Translate Indonesian-English Using Binary Search

Maria Atik Sunarti Ekowati; Zefanya Permata Nindyatama; Widianto Widianto; Kristyanan Dananti

doi:10.47194/ijgor.v3i3.167

Authors

Maria Atik Sunarti Ekowati
maria.atik@uks.ac.id
Informatics Engineering Study Program, Faculty of Engineering, Surakarta Christian University, Central Java, Indonesia
Zefanya Permata Nindyatama Communication Studies Program, Social and Political Sciences, Sebelas Maret University, Surakarta, Central Java, Indonesia
Widianto Widianto Environmental Engineering Study Program, Faculty of Engineering, Surakarta Christian University, Central Java, Indonesia
Kristyanan Dananti Management Study Program, Faculty of Economics, Surakarta Christian University, Central Java, Indonesia

Keywords:

Algorithm, Binary Search, Sorting, Bubble Sort, Merge Sort.

Abstract

In Indonesia, English is a compulsory subject for students. This course is an uninteresting subject and tends to be difficult for students to understand. Meanwhile, on the other hand, international issues are often discussed, namely English which is Students must know and be fluent in reading, writing and communication. The basic idea of research objectives, comparing the sorting process using two different algorithms, namely bubble sort and Merge Sort. The basic model of the research method Comparative Analysis of the Speed of the Shorting Method on Google Translate Indonesian-English Using Binary Search. Sorting, Sorted (ordered according to certain rules/rules), and the data is presented in sorted form, as said in dictionaries, and files in a directory. The algorithm used for sorting is bubble sort, which is an element comparison operation that is exchanged for other elements until the end of the data series is reached, until no more elements are swapped. Results for find out how well the performance speed of the bubble sort algorithm is in sorting data.

References

Hibbler, R. (2015). Merge Sort. Dept. of Computer Science. Florida Institute of Technology. Florida, USA.

Sonita, A., Nurtaneo, F. (2015). Comparative Analysis of Bubble Sort, Merge Sort, and Quick Sort Algorithms in the Process of Sorting Combinations of Numbers and Letters. Journal of Pseudecode, Vol 2, No. 2, pp. 75-80.

Horman, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C. (2016). Introduction to Algorithms. The MIT Press. Cambridge. Massachusetts London. England

Karve, S. (2016). Insertion Sort Example. http://www.dreamincode.net/code/snipp et279.htm. Retrieved 18 May 2016.

Kumalasari, D. (2017). Comparative Analysis of the Complexity of Bubble Sort, Cocktail Sort and Comb Sort Algorithms with C++ Programming Language. Journal of Engineering and Education Research Centers (SPEED), Vol. 9, No. 2, pp. 1-7.

Drozdek, A. (2017). Data Structures and Algorithms in C++. Brooks/Cole Thomson Learning. California. USA.

Sitepu, R. R. (2017). Implementation of Bubble Sort and Selection Sort Algorithm Using Multidimensional Arraylist in Multi-Priority Data Sorting. Journal of Computing, Vol. 5, No. 1, 2017, pp. 81-87.

Bingheng, W. (2018). Merge Sort. Dept. of Computer Science. Florida Institute of Technology. Florida, USA.

Tambunan, H. S. (2018). Optimization of Shell Sort Algorithm in Sorting Letters and Numbers Data. Prima Computer Science Information System Journal (JUSIKOM PRIMA), Vol. 2, No. 1, pp. 23-27 .

Rachmat, N. (2018). Comparison of Bubble Sort, Shell Sort, and Combination of Bubble Sort with Shell Sort. JUSIKOM Journal, Vol. 3, No. 1, pp. 59-64.

Rheinadi, R. (2019). Algorithmic Strategy. Bandung Institute of Technology Paper