Matches in SemOpenAlex for { <https://semopenalex.org/work/W2601974418> ?p ?o ?g. }
Showing items 1 to 51 of
51
with 100 items per page.
- W2601974418 abstract "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." @default.
- W2601974418 created "2017-04-07" @default.
- W2601974418 creator A5019009323 @default.
- W2601974418 date "2016-09-01" @default.
- W2601974418 modified "2023-09-25" @default.
- W2601974418 title "ANALISA PERBANDINGAN KOMPLEKSITAS ALGORITMA SELECTIONSORT DAN INSERTIONSORT" @default.
- W2601974418 hasPublicationYear "2016" @default.
- W2601974418 type Work @default.
- W2601974418 sameAs 2601974418 @default.
- W2601974418 citedByCount "0" @default.
- W2601974418 crossrefType "journal-article" @default.
- W2601974418 hasAuthorship W2601974418A5019009323 @default.
- W2601974418 hasConcept C108094655 @default.
- W2601974418 hasConcept C111696304 @default.
- W2601974418 hasConcept C111919701 @default.
- W2601974418 hasConcept C11413529 @default.
- W2601974418 hasConcept C154945302 @default.
- W2601974418 hasConcept C23123220 @default.
- W2601974418 hasConcept C311688 @default.
- W2601974418 hasConcept C41008148 @default.
- W2601974418 hasConcept C81917197 @default.
- W2601974418 hasConcept C88548561 @default.
- W2601974418 hasConcept C98045186 @default.
- W2601974418 hasConceptScore W2601974418C108094655 @default.
- W2601974418 hasConceptScore W2601974418C111696304 @default.
- W2601974418 hasConceptScore W2601974418C111919701 @default.
- W2601974418 hasConceptScore W2601974418C11413529 @default.
- W2601974418 hasConceptScore W2601974418C154945302 @default.
- W2601974418 hasConceptScore W2601974418C23123220 @default.
- W2601974418 hasConceptScore W2601974418C311688 @default.
- W2601974418 hasConceptScore W2601974418C41008148 @default.
- W2601974418 hasConceptScore W2601974418C81917197 @default.
- W2601974418 hasConceptScore W2601974418C88548561 @default.
- W2601974418 hasConceptScore W2601974418C98045186 @default.
- W2601974418 hasLocation W26019744181 @default.
- W2601974418 hasOpenAccess W2601974418 @default.
- W2601974418 hasPrimaryLocation W26019744181 @default.
- W2601974418 hasRelatedWork W1547236215 @default.
- W2601974418 hasRelatedWork W183590018 @default.
- W2601974418 hasRelatedWork W1976560320 @default.
- W2601974418 hasRelatedWork W1979268364 @default.
- W2601974418 hasRelatedWork W2073550788 @default.
- W2601974418 hasRelatedWork W2373817572 @default.
- W2601974418 hasRelatedWork W2392133629 @default.
- W2601974418 hasRelatedWork W2432916743 @default.
- W2601974418 hasRelatedWork W2614848892 @default.
- W2601974418 hasRelatedWork W2941856566 @default.
- W2601974418 isParatext "false" @default.
- W2601974418 isRetracted "false" @default.
- W2601974418 magId "2601974418" @default.
- W2601974418 workType "article" @default.