show tht the greedy algorithm always yeilds an optimal solution??/
On Tue, Oct 5, 2010 at 7:47 PM, sharad kumar <[email protected]>wrote:
> int denom(int Coin[],int n,int amount)
> {
> for(i=0;i<n;++i)
> {
> c=Coin[i];
> for(j=c;j<=amount;++j)
> {
> den[j]+=d[j-c];
> }
> }
> return den[amount];
> }
>
>
>
> On Wed, Oct 6, 2010 at 4:43 AM, pre lak <[email protected]> wrote:
>
>> Hi all,
>>
>> Pls help me with the solution to the following problem related to the coin
>> changing problem.
>>
>> suppose that the available coins a ein the denominations c^0, c^1 , c^2...
>> c^k for some intgers c>1 and k>=1. show tht the greedy algorithm always
>> yeilds an optimal solution
>>
>> thanks in advance
>> Preethi
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to [email protected].
>> To unsubscribe from this group, send email to
>> [email protected]<algogeeks%[email protected]>
>> .
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
>
>
> --
> yezhu malai vaasa venkataramana Govinda Govinda
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to [email protected].
> To unsubscribe from this group, send email to
> [email protected]<algogeeks%[email protected]>
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
