[algogeeks] max product of any three nos in an array of signed integers

Given an array of integers (signed integers), find three numbers in that array which form the maximum product. --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send emai

[algogeeks] Re: what will happen in the village

yes sharad. I dont see any progress that can happen. It should be a deadlock On Sep 13, 4:24 pm, sharad kumar wrote: > i think ther mite be a deadlock > > On Sun, Sep 13, 2009 at 4:17 PM, SP Praveen wrote: > > > > > > >  given a village with demons and a s

[algogeeks] what will happen in the village

given a village with demons and a sleeping man, The man is always sleeping ,never wakes up. Now a demon can eat the sleeping man , but after that he will fall asleep , any demon can eat another sleeping demon. If demons are very smart and would always choose to stay alive than to eat the man