Program Pemecahan uang Algoritma Greedy

LISTING PROGRAM

#include<stdio.h>

#include<conio.h>

#include <stdlib.h>

#define size 99

void sort (int[],int);

main ()

{

int x[size],i,n,uang,hasil[size]; 

                printf("\n banyak koin :");           

                scanf("%d",&n);                                            

                printf("\n \n masukkan jenis koin :\n");

for (i=1;i<=n;i++)                             

                {

                                scanf ("%d",&x[i]);        

                }

                sort (x,n);

                                printf("\n koin yang trsedia\n :");

for (i=1;i<=n;i++)             

                                {

                                                printf ("%d", x[i]);

                                                printf  ("\n");    

                                }

                                printf  ("\n");                    

printf  ("\n masukkan nilai yang dipecah :");        

                                scanf ("%d",&uang);      

                                printf  ("\n");                   

for (i = 1; i<=n;i++)         

                                {

hasil[i] = uang/x[i];

                                                uang = uang%x[i];

                                }

                                for(i=1;i<=n;i++)

                                {

                                                printf("keping %d",x[i]);

                                                printf("-an sebanyak : %d", hasil [i]);

                                                printf("\n \n");

                                }

                getch ();

                return 0;

}

                void sort (int a[], int siz)

                {

                                int pass,hold,j;

                                for (pass = 1 ; pass<=siz-1;pass++)

                                {

                                                for (j = 0;j<=siz-2;j++)

                                                {

                                                                if (a[j+1] < a[j+2])

                                                                 {

                                                                                hold  = a[j+1];

                                                                                a[j+1] = a[j+2];

                                                                                a[j+2] = hold;

                                                                  }

                                                 }

                                 }

OUTPUT PROGRAM