Perbandingan Bubble Sort dengan Insertion Sort pada Bahasa Pemrograman C dan Fortran
Keywords:algorithm, sorting, bubble sort, insertion sort, C, FORTRAN
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.
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
Authors who publish with this journal agree to the following terms:
a. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License - Share Alike that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
b. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
c. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
All articles published Open Access will be immediately and permanently free for everyone to read and download. We are continuously working with our author communities to select the best choice of license options, currently being defined for this journal as follows: