ComTech: Computer, Mathematics and Engineering Applications
Vol. 4 No. 2 (2013): ComTech

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

Reina Reina (Bina Nusantara University)
Josef Bernadi Gautama (Bina Nusantara University)



Article Info

Publish Date
01 Dec 2013

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 lesspopular 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.

Copyrights © 2013






Journal Info

Abbrev

comtech

Publisher

Subject

Computer Science & IT Engineering Mathematics

Description

The journal invites professionals in the world of education, research, and entrepreneurship to participate in disseminating ideas, concepts, new theories, or science development in the field of Information Systems, Architecture, Civil Engineering, Computer Engineering, Industrial Engineering, Food ...