Article Per Year (5 Year)
p-Index From 2019 - 2024
0.23
P-Index
This Author published in this journals
All Journal Algoritme Jurnal Mahasiswa Teknik Informatika
Rheza Rijaya
Unknown Affiliation
Computer Science & IT

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Perbandingan Penempatan Pivot Pada Quick Sort Berdasarkan Ukuran Pemusatan Data Rheza Rijaya; Muhammad Ezar Al Rivan
Jurnal Algoritme Vol 4 No 1 (2023): Jurnal Algoritme
Publisher : Program Studi Teknik Informatika Universitas Multi Data Palembang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35957/algoritme.v4i1.5735

Abstract

Sorting is one of the basic algorithm that executed frequently in a program. The most popular sorting algorithm is Quick Sort because it is faster in most scenarios than other algorithms. However, pivot selection on Quick Sort algorithm is very important to avoid the worst case scenario. This study aims to test commonly used pivot selection methods (first, middle, last) and pivot selection based on central tendency of data (mean, median, mode). The data that is tested are random data (repeated), random data (permutation), sorted, reverse-sorted, and almost sorted. The size of data that is tested are 1.000, 10.000, 100.000, dan 1.000.000. The best result is achieved by selecting middle element as pivot based on the execution time of each scenario.
Co-Authors Muhammad Ezar Al Rivan