The main difference between the standard CC algo, and the one with limited
coin supply is the maximum value that we can form with the given coins.
For example :
In stranded CC
coins = {1,2,3}
then we can can form denominations to any value(assuming that coin with 1
value will always be there).
The main difference between the standard CC algo, and the one with limited
coin supply is the maximum value that we can form with the given coins.
For example :
In stranded CC
coins[] = {1,2,3}
then we can can form denominations to any value(assuming that coin with 1
value will always be the
BFS might be faster, though.
Don
On Tuesday, April 22, 2014 1:11:00 AM UTC-4, bujji wrote:
>
> Hi Don,
> At most we can reach a point from 4 adjacent points. So,
> time complexity will be O(XY) only.
>
> -Thanks,
> Bujji.
>
>
> On Mon, Apr 21, 2014 at 1:38 PM, bujji jajala
> > wrot
Shashwat, very nice.
Don
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to algogeeks+unsubscr...@googlegroups.com.
