Perbandingan Bubble Sort dengan Insertion Sort pada Bahasa Pemrograman C dan Fortran

Reina Reina, Josef Bernadi Gautama

Abstract


Sorting is a basic algorithm studied by students of computer science major. Sorting algorithm is the basis of other algorithms such as searching algorithm, pattern matching algorithm. Bubble sort is a popular basic sorting algorithm due to its easiness to be implemented. Besides bubble sort, there is insertion sort. It is less
popular than bubble sort because it has more difficult algorithm. This paper discusses about process time between insertion sort and bubble sort with two kinds of data. First is randomized data, and the second is data of descending list. Comparison of process time has been done in two kinds of programming language that is C programming language and FORTRAN programming language. The result shows that bubble sort needs more time than insertion sort does.


Keywords


algorithm, sorting, bubble sort, insertion sort, C, FORTRAN

Full Text:

PDF

References


Astrachan, Owen. (2003). Bubble sort: an archaeological algorithmic analysis. SIGCSE Bull, 35(1), 1 – 5.

Nyhoff, L., & Leestma, S. (1983). FORTRAN 77 for Engineers and Scientists. Canada: Macmillan Publishing Company.

Wang, Sunny Y. (1996). A New Sort Algorithm: Self-Indexed Sort. SIGPLAN Notices, 31, 28 – 36. DOI:10.1145/227717.227725




DOI: https://doi.org/10.21512/comtech.v4i2.2553

Refbacks

  • There are currently no refbacks.



Public Visitor Statistics:ComTech stats
Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.