ANALISA PERBANDINGAN KOMPLEKSITAS ALGORITMA SELECTIONSORT DAN INSERTIONSORT

Jurnal Informatika

View Publication Info
 
 
Field Value
 
Title ANALISA PERBANDINGAN KOMPLEKSITAS ALGORITMA SELECTIONSORT DAN INSERTIONSORT
 
Creator Maulana, Reza
 
Subject Sistem Informasi
 
Description                                           Abstract Sorting of data is one of the critical operations in data processing. There are various sorting algorithms. However, only some of which are used as the basis for the introduction and understanding of the learning process in an institution. Among the selection sort and insertion sort. Both sorting algorithm that is the focus of discussion on this scientific work. Is the domain on this occasion is a time to try to analyze the speed of the algorithm selection sort and insertion sort, with all the data input in the form of integers in a list or array of data at random intervals between 1,000 and 100,000 elements. Sorting algorithms selection algorithm has a complexity of O (n2 ), the same as the insertion sorting algorithms. Each of these types of algorithms have different levels of effectiveness. The effectiveness of an algorithm can be measured by how the amount of time it takes to run the algorithm. This article will only discuss and analyze the complexity of time for each type of algorithm. The algorithm is written in this paper is an algorithm that is implemented in C ++ programming language. Based on the complexity of the test of time, it can be concluded that the insertionsort algorithm is faster, than the selectionsort algorithm.
 
Publisher LPPM Universitas BSI
 
Contributor
 
Date 2016-09-15
 
Type info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion


 
Format application/pdf
 
Identifier http://ejournal.bsi.ac.id/ejurnal/index.php/ji/article/view/810
10.31311/ji.v3i2.810
 
Source Jurnal Informatika; Vol 3, No 2 (2016): Jurnal INFORMATIKA
Jurnal Informatika; Vol 3, No 2 (2016): Jurnal INFORMATIKA
2528-2247
2355-6579
 
Language ind
 
Relation http://ejournal.bsi.ac.id/ejurnal/index.php/ji/article/view/810/938
 
Rights ##submission.copyrightStatement##
 

Contact Us

The PKP Index is an initiative of the Public Knowledge Project.

For PKP Publishing Services please use the PKP|PS contact form.

For support with PKP software we encourage users to consult our wiki for documentation and search our support forums.

For any other correspondence feel free to contact us using the PKP contact form.

Find Us

Twitter

Copyright © 2015-2018 Simon Fraser University Library