Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Analisis Algoritma Insertion Sort, Merge Sort Dan Implementasinya Dalam Bahasa Pemrograman C++

JURNAL INFOTEL · Vol. 4 No. 2 (2012) · hlm. 10–10

DOI
10.20895/infotel.v4i2.103
ISSN
2085-3688, 2460-0997
Terbit
2012-11-10
Penerbit
LPPM Institut Teknologi Telkom Purwokerto
Bahasa
en
Lisensi
creativecommons.org/licenses/by-sa/4.0/

Abstrak

This paper presents the study of implementation and performance in sorting process, using two different algorithms, namely Insertion Sort and Merge Sort. In the first stage, the two algorithms were implemented in C++ language to sort several numbers typed by a user. In the second stage, the source codes for those algorithms were modified to enable sorting randomly generated numbers with the amount as requested by the user. To find out how well they performed in sorting out the data, therefore in the last stage the two algorithms were tested to sort random numbers with predetermined amount ranges and the results were compared. From the experiments performed, merge sort algorithm had shown a better performance, particularly in a large number of data (> 10000). Insertion sort algorithm has the advantage in lower complexity algorithm, notably in the best case condition and since it does not use recursion routines in sorting process, hence it does not require as much storage space or memory as needed by merge sort algorithm.

Kata kunci

Jaringan kolaborasi para penulis

14 penulis · 23 tautan kepenulisan bersama · 5 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Institut Teknologi Telkom Purwokerto
  • Telkom University
  • Institut Teknologi Sepuluh Nopember
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Jaenal ArifinInstitut Teknologi Sepuluh Nopember2
Eka WahyudiTelkom University2
Wahyu PamungkasTelkom University1
Asita Shoman MuzakiAfiliasi tidak diketahui1
Relesa Anggita Permata T. WInstitut Teknologi Telkom Purwokerto1
Wasis Dasa NugrahaAfiliasi tidak diketahui1
Chandra AP SimorangkirAfiliasi tidak diketahui1
Tenia WahyuningrumInstitut Teknologi Telkom Purwokerto1
Dwi JanuaritaInstitut Teknologi Telkom Purwokerto1
Eko Puji UtomoAfiliasi tidak diketahui1
Niat Bagus SantosaAfiliasi tidak diketahui1
Eldia RantedopingAfiliasi tidak diketahui1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OpenAlex API (jurnal SINTA, ADR 0048) https://openalex.org/S4210188896, pertama di-harvest 19 Nov 2026, terakhir terlihat 19 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title xml:lang="en">Analisis Algoritma Insertion Sort, Merge Sort Dan Implementasinya Dalam Bahasa Pemrograman C++</dc:title><dc:creator>Arief Hendra Saptadi</dc:creator><dc:creator>Desi Windi Sari</dc:creator><dc:subject>insertion sort</dc:subject><dc:subject>merge sort</dc:subject><dc:subject>sorting algorithms</dc:subject><dc:subject>algorithm comparison</dc:subject><dc:subject>C++ implementation</dc:subject><dc:subject>random data generation</dc:subject><dc:subject>time complexity</dc:subject><dc:subject>memory usage</dc:subject><dc:description xml:lang="en">This paper presents the study of implementation and performance in sorting process, using two different algorithms, namely Insertion Sort and Merge Sort. In the first stage, the two algorithms were implemented in C++ language to sort several numbers typed by a user. In the second stage, the source codes for those algorithms were modified to enable sorting randomly generated numbers with the amount as requested by the user. To find out how well they performed in sorting out the data, therefore in the last stage the two algorithms were tested to sort random numbers with predetermined amount ranges and the results were compared. From the experiments performed, merge sort algorithm had shown a better performance, particularly in a large number of data (&gt; 10000). Insertion sort algorithm has the advantage in lower complexity algorithm, notably in the best case condition and since it does not use recursion routines in sorting process, hence it does not require as much storage space or memory as needed by merge sort algorithm.</dc:description><dc:publisher>LPPM Institut Teknologi Telkom Purwokerto</dc:publisher><dc:date>2012-11-10</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.20895/infotel.v4i2.103</dc:identifier><dc:identifier>10.20895/infotel.v4i2.103</dc:identifier><dc:source>JURNAL INFOTEL; Vol 4 No 2 (2012); 10-10</dc:source><dc:source>2085-3688</dc:source><dc:source>2460-0997</dc:source><dc:language>en</dc:language><dc:relation>https://ejournal.st3telkom.ac.id/index.php/infotel/article/download/103/100</dc:relation><dc:rights>https://creativecommons.org/licenses/by-sa/4.0/</dc:rights></oai_dc:dc>