Ashri , Rahmi Hijriati (2000) Analisa algoritma radixsort dengan bahasa pemrograman pascal. Undergraduate thesis, FMIPA UNDIP.
PDF Restricted to Repository staff only 2015Kb | ||
| PDF 20Kb | |
| PDF 219Kb | |
| PDF 384Kb | |
| PDF 247Kb | |
| PDF 814Kb | |
PDF Restricted to Repository staff only 631Kb | ||
| PDF 223Kb | |
| PDF 223Kb | |
| PDF 390Kb |
Abstract
Algoritma RadixSort berdasarkan nilai sebenarnya dari suatu digit pada bilangan yang diurutkan. Untuk memudahkan proses penyeleksian record-record yang diurutkan digunakan senarai berantai dan melalui sejumlah antrian sesuai digitnya masing-masing. Kemudian dianalisa untuk menentukan Running Time nya. Radix sort algorithm is an algorithm which is based on the real value from a digit to a series number. To make easy the selection process of series records, we use linked list and through some queue which are appropriate for each digit. Then we analyze them to determine their running time.
Item Type: | Thesis (Undergraduate) |
---|---|
Subjects: | Q Science > QA Mathematics |
Divisions: | Faculty of Science and Mathematics > Department of Mathematics |
ID Code: | 31807 |
Deposited By: | Mr UPT Perpus 1 |
Deposited On: | 25 Nov 2011 09:13 |
Last Modified: | 25 Nov 2011 09:13 |
Repository Staff Only: item control page