int changemaking( int coin[] , int number_of_coins , int sum )
    int i,j,added1,added2;
    int  matrix[number_of_coins+1][sum+1];
    for(j=0;j<=sum;j++)
    matrix[0][j]= 10000;
    for(i=1;i<=number_of_coins;i++)
    matrix[i][0]=0;
    for(i=1;i<=number_of_coins;i++)
    {for(j=1;j<=sum;j++)
    if(j>=coin[i-1])
    added1=matrix[i-1][j];
    added2=1+matrix[i][j-coin[i-1]];
    matrix[i][j]= minimum(added1,added2);
    else
    matrix[i][j]=matrix[i-1][j];
    return matrix[number_of_coins][sum];