PERBANDINGAN BUBBLE SORT DENGAN INSERTION SORT PADA BAHASA PEMROGRAMAN C DAN FORTRAN
Journal: Comtech (Vol.4, No. 2)Publication Date: 2013-12-29
Authors : Reina; Josef Bernadi Gautama;
Page : 1106-1115
Keywords : algorithm; sorting; bubble sort; insertion sort; C; FORTRAN;
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.
Other Latest Articles
- EVALUASI PROSES BISNIS MATERIAL MANAGEMENT BERBASIS SAP: STUDI KASUS PADA PERUSAHAAN CONSUMER GOODS
- PERILAKU BERWIRAUSAHA DI KALANGAN MAHASISWA UNIVERSITAS BINA NUSANTARA (BINUS)
- PENGEMBANGAN MODEL APLIKASI ADMINISTRASI PELAYANAN KESEHATAN DI PUSKEMAS DENGAN CLOUD COMPUTING BERBASISKAN OPEN SOURCE
- CLOUD COMPUTING DAN DAMPAKNYA TERHADAP BISNIS
- REPLIKASI UNIDIRECTIONAL PADA HETEROGEN DATABASE
Last modified: 2015-11-17 15:47:18