Article Per Year (5 Year)
p-Index From 2020 - 2025
0
P-Index
This Author published in this journals
All Journal Jurnal ULTIMATICS
Audy Audy
Unknown Affiliation
Computer Science & IT Control & Systems Engineering Electrical & Electronics Engineering Engineering

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

Found 1 Documents
Search

 1 
Komparasi Algoritma Quicksort dan Bucket Sort pada Pengurutan Data Integer Audy Audy
Ultimatics : Jurnal Teknik Informatika Vol 7 No 1 (2015): Ultimatics: Jurnal Ilmu Teknik Informatika
Publisher : Faculty of Engineering and Informatics, Universitas Multimedia Nusantara

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (631.408 KB) | DOI: 10.31937/ti.v7i1.343

Abstract

Data sorting is a technique that widely used as a part of a bigger process. Therefore, data sorting should not be the problem of program complexity. This paper gives the reader a comparison between two sorting algorithms, which are comparison based and non-comparison based, in time and space performance. The data type that used in this paper is an integer data type. Testing is carried out by using two types of data’s condition, which are the worst-case condition in each algorithm, and two amounts of data, which represent the maximum and minimum amount data.
Co-Authors