[algogeeks] Re: Find all the subset of an array whose sum is equal to some number

2011-02-08 Thread bittu
isn't the problem of of genrating all subset e.g. power set & in that power set we have check which subset has the sum value equal to given sum thats it... -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send e

[algogeeks] Re: Find all the subset of an array whose sum is equal to some number

2010-12-28 Thread shanushaan
Thanks , I need to learn sml now :). I was looking for the conversation over algo development and hints to do that. On Dec 25, 10:04 pm, Puneet Ginoria wrote: > This attachment contains the code for the above program in SML language and > it uses lambda calculus. > > > > > > > > On Sat, Dec 25, 2

[algogeeks] Re: Find all the subset of an array whose sum is equal to some number

2010-12-28 Thread shanushaan
On what basis we will divide the array. (Eg 1. Sort and divide them on positive negative ) On Dec 25, 10:52 pm, radha krishnan wrote: > This s similar to the problemhttps://www.spoj.pl/problems/SUBSUMS/ > we have to split the array into 2 arrays > say A,B > generate all subsets of each array(both

[algogeeks] Re: Find all the subset of an array whose sum is equal to some number

2010-12-28 Thread shanushaan
Well All the subsets, not the number On Dec 25, 8:48 pm, juver++ wrote: > What you need to get for the answer - amount of such subsets or display > them? > First problem can be solved using DP. > Second - brute force. -- You received this message because you are subscribed to the Google Groups

[algogeeks] Re: Find all the subset of an array whose sum is equal to some number

2010-12-26 Thread Arif Ali Saiyed
http://en.wikipedia.org/wiki/Subset_sum_problem On Dec 25, 10:52 pm, radha krishnan wrote: > This s similar to the problemhttps://www.spoj.pl/problems/SUBSUMS/ > we have to split the array into 2 arrays > say A,B > generate all subsets of each array(both A and B) and another > array(A1,B1) to st

Re: [algogeeks] Re: Find all the subset of an array whose sum is equal to some number

2010-12-25 Thread radha krishnan
This s similar to the problem https://www.spoj.pl/problems/SUBSUMS/ we have to split the array into 2 arrays say A,B generate all subsets of each array(both A and B) and another array(A1,B1) to store the sum of each subset now take each element of A1 and binarysearch B1 to achieve this sum assume k

Re: [algogeeks] Re: Find all the subset of an array whose sum is equal to some number

2010-12-25 Thread Puneet Ginoria
sorry i forgot to attach here it is On Sat, Dec 25, 2010 at 10:34 PM, Puneet Ginoria wrote: > This attachment contains the code for the above program in SML language and > it uses lambda calculus. > > > On Sat, Dec 25, 2010 at 9:18 PM, juver++ wrote: > >> What you need to get for the answer

Re: [algogeeks] Re: Find all the subset of an array whose sum is equal to some number

2010-12-25 Thread Puneet Ginoria
This attachment contains the code for the above program in SML language and it uses lambda calculus. On Sat, Dec 25, 2010 at 9:18 PM, juver++ wrote: > What you need to get for the answer - amount of such subsets or display > them? > First problem can be solved using DP. > Second - brute force. >

[algogeeks] Re: Find all the subset of an array whose sum is equal to some number

2010-12-25 Thread juver++
What you need to get for the answer - amount of such subsets or display them? First problem can be solved using DP. Second - brute force. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegr