simple manipulation ans = max( (smallest negative number 1 * smallest negative number 2 * largest positive number 1), (largest positive number 1, largest positive number 2, largest positive number 3) )
On Sun, Aug 7, 2011 at 7:04 PM, Prakash D <[email protected]> wrote: > that won't work.. there may be two negative bigger numbers whose product > will bcom +ve > > > On Sun, Aug 7, 2011 at 6:49 PM, Puneet Ginoria <[email protected]>wrote: > >> find the first three largest nos. and 3 smallest number(negatives).. then >> easily you can fig. out the solution.. >> >> O(6n) solution i guess which is O(n).... >> >> -- >> 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. >> > > -- > 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. > -- 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.
