8C5 (8!/(3! * 5!)) On Tue, Oct 12, 2010 at 5:09 PM, divya <[email protected]> wrote:
> Given a sorted array A with 8 integers.We want to have 2 sorted arrays > B(with 5 integers) > And C(with 3 integers) such that merging B and C would result in A. > How many such pairs exists > > -- > 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]<algogeeks%[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.
