CHOLIS , MOHAMMAD NUR (1997) ALGORITMA GREEDY DAN MINDIST UNTUK PENYELESAIAN MASALAH MAKING CHANGE. Undergraduate thesis, FMIPA Undip.
![[img]](/style/images/fileicons/application_pdf.png)
| PDF 15Kb | |
| PDF 99Kb | |
| PDF 24Kb | |
| PDF 70Kb | |
| PDF 350Kb | |
| PDF 571Kb | |
| PDF Restricted to Repository staff only 180Kb | |
| PDF 20Kb | |
| PDF 32Kb | |
| PDF 192Kb | |
| PDF Restricted to Repository staff only 1505Kb |
Abstract
ABSTRACK The making change is a problem about how should some one assemble the required change of C to a customer. There are two algorithms that presented to solve the problem, called Greedy Algorithm and MINDIST. - -4 And then one of both algorithms implemented in Pascal language progamming. ABSTRAK Making change adalah suatu masalah tentang bagaimana seharusnya seseorang memberikan sisa kembalian sebesar C kepada seorang pelanggan. Untuk menyelesaikan masalah tersebut disajikan dua buah algoritma yang dikenal dengan Algoritma Greedy dan MINDIST. Kemudian salah satu dari kedua algoritma tersebut akan diimplementasikan dalam bahasa pemrograman Pascal.
| Item Type: | Thesis (Undergraduate) |
|---|---|
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Faculty of Science and Mathematics > Department of Mathematics |
| ID Code: | 32328 |
| Deposited By: | Mr UPT Perpus 1 |
| Deposited On: | 05 Jan 2012 12:42 |
| Last Modified: | 05 Jan 2012 12:42 |
Repository Staff Only: item control page
