Re: [algogeeks] Code it...

2011-10-16 Thread amrit harry
use a file...every time we run it... get number from file increment it print it and again replace back to filedats it. On Sat, Oct 15, 2011 at 3:56 PM, kumar raja wrote: > > you have to write a program which tell about how many times it has run. > ex: > if you run first time it will print 1.

[algogeeks] Code it...

2011-10-16 Thread kumar raja
you have to write a program which tell about how many times it has run. ex: if you run first time it will print 1. if you run second time it will print 2. like this. -- Regards Kumar Raja M.Tech(SIT) IIT Kharagpur, 10it60...@iitkgp.ac.in -- You received this message because you are subscribed t

Re: [algogeeks] Code it

2011-09-10 Thread Ishan Aggarwal
can someone plz provide the solution to it??? On Sat, Sep 10, 2011 at 9:30 PM, sukran dhawan wrote: > best way it to invoke the function recursively > > just like a k-1 ary tree > correct me if im wrong > > On Sat, Sep 10, 2011 at 2:49 PM, Ishan Aggarwal < > ishan.aggarwal.1...@gmail.com> wrote:

Re: [algogeeks] Code it

2011-09-10 Thread sukran dhawan
best way it to invoke the function recursively just like a k-1 ary tree correct me if im wrong On Sat, Sep 10, 2011 at 2:49 PM, Ishan Aggarwal < ishan.aggarwal.1...@gmail.com> wrote: > What would be the efficient way to code this program.?? > > Given an array of size n, find all the possible sub

[algogeeks] Code it

2011-09-10 Thread Ishan Aggarwal
What would be the efficient way to code this program.?? Given an array of size n, find all the possible sub set of the array of size k(all the subsets must be of size k). -- Kind Regards Ishan Aggarwal Phone : +91-9654602663 -- You received this message because you are subscribed to the Googl