PERBANDINGAN BUBBLE SORT DENGAN INSERTION SORT PADA BAHASA PEMROGRAMAN C DAN FORTRAN

Reina, Reina and Bernadi Gautama, Josef (2013) PERBANDINGAN BUBBLE SORT DENGAN INSERTION SORT PADA BAHASA PEMROGRAMAN C DAN FORTRAN. Jurnal ComTech, 04 (02). ISSN 2087-1244

Full text not available from this repository.
Official URL: http://library.binus.ac.id/Collections/journal_det...

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.

Item Type: Article
Additional Information: 25_Volume 04 / Nomor 02 / December 2013_PERBANDINGAN BUBBLE SORT DENGAN INSERTION SORT PADA BAHASA PEMROGRAMAN C DAN FORTRAN
Subjects: ?? subjectjournal_25 ??
Divisions: ?? journal_32_25_Volume-04-Nomor-02-December-2013 ??
Depositing User: Mr. Super Admin
Date Deposited: 03 Jul 2014 14:54
Last Modified: 03 Jul 2014 20:03
URI: http://eprints.binus.ac.id/id/eprint/30897

Actions (login required)

View Item View Item