Read the question again..only 3rd case you have mentioned needs t On Wed, Oct 13, 2010 at 12:58 PM, Shiyam code_for_life < mailshyamh...@gmail.com> wrote:
> First lets look at how many ways the array can be split > (1) 1,7 > (2) 2,6o be considered here... > (3) 3,5 > (4) 4,4 > > Now how many combinations in each > > 1,7 => 8 combinations for first array > 2,6 => 8*7 combinations for first array > 3,5 => 8*7*6 combinations for first array > 4,4 => 8*7*6*5 combinations for first array > > so its the sum (8) + (8*7) + (8*7*6) + (8*7*6*5) > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > 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 algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
