@Anup : I think you should also try to compile and check the answer... May be I am wrong.... But compiler won't
On Mon, Aug 29, 2011 at 11:02 PM, Anup Ghatage <[email protected]> wrote: > @Rajeev: > > I had written down the recursion tree on paper but since you said that > there were 10 reds and greens, I compiled the code and checked it myself. > I'm afraid you are wrong my friend. > > The correct answer is indeed 6 RED and 10 GREEN calls. > > -- > Anup Ghatage > > -- > 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. > -- Regards Rajeev N B <http://www.opensourcemania.co.cc> "*Winners Don't do Different things , they do things Differently"* -- 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.
