Layanan journal yang disediakan oleh Perpustakaan Universitas Gunadarma
| Judul Artikel | : | Komparasi Algoritma Quicksort dan Bucket Sort pada Pengurutan Data Integer |
|---|---|---|
| Judul Terbitan | : | ULTIMATICS JURNAL TEKNIK INFORMATIKA |
| ISSN | : | 2085-4552 |
| Bahasa | : | IND |
| Tempat Terbit | : | TANGERANG |
| Tahun | : | 0000 |
| Volume | : | Vol. 7 Issue 1 0000 |
| Penerbit | : | Universitas Multimedia Nusantara (UMN) |
| Frekuensi Penerbitan | : | 1 x 1 tahun |
| Penulis | : | Audy |
| Abstraksi | : | 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. |
| Kata Kunci | : | Terms-quicksort; bucket sort; pseudocode; cost; pivot; bucket; rekursif; integer; divide and conquer |
| Lokasi | : | P7 |
| Terakreditasi | : | belum |