ANALISA PERBANDINGAN KOMPLEKSITAS ALGORITMA SELECTIONSORT DAN INSERTIONSORT

• Main Author: Reza Maulana
• Format: Article
• Language: Indonesian
• Published: Universitas Bina Sarana Informatika, LPPM 2016-09-01
• Series: Jurnal Informatika
• Online Access: http://ejournal.bsi.ac.id/ejurnal/index.php/ji/article/view/810

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.