Finding possible combination from an array elements where Sum is equal to

Question

I have a requirement where i have to find a list of combinations where the sum =180. I have an array of intergers and have to pick up the elements from this array only.

For example : Array = {30,45,60,15,60,30} now i as an output should get - 60,60,30,30 or 45,15,60,30,30 or 45,15,60,60

I am trying various approaches but its failing in one or the other scenario. Please suggest implementation in C#.

Please provide inputs.

Thanks

Please provide what you've tried ... (it's a rather trivial question, but I don't feel the need to solve other people homework if they didn't tried anything ... ) — Noctis
– Noctis, Commented Nov 11, 2013 at 11:50
Possibilities are there, You show your try..This is similar to probability.. — Sasidharan
– Sasidharan, Commented Nov 11, 2013 at 11:52
ahhh ... the possibilities ... recursion ... loops ... iterations ... brute force ... smart objects ... energy wielding dogs ... if only the OP have tried something ... — Noctis
– Noctis, Commented Nov 11, 2013 at 11:56
Sort out array by weight in descending order and use recursively calls to approach to decision. Each call is try to take the next number (stone))) to summarize. — KittenLS
– KittenLS, Commented Nov 11, 2013 at 11:58

Community · Accepted Answer · 2017-05-23 12:05:02Z

1

Sub set problems solutions can be found everywhere on the net or stack overflow:

Try this:

Sum array values with sum equals X

edited May 23, 2017 at 12:05

CommunityBot

11 silver badge

answered Nov 11, 2013 at 12:17

ClotzA

1717 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

Finding possible combination from an array elements where Sum is equal to

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related