merge N/2 +1 times... On Sat, Dec 4, 2010 at 7:48 AM, Gene <gene.ress...@gmail.com> wrote:
> This isn't quite right because you don't have to merge all the initial > companies pairwise. I.e. you skip the case where A and B merge and > then the result is merged with C. > > Rather, the answer is the number of binary trees with N leaves. (This > does assume that all mergers involve only 2 companies.) I'll let you > look up how to compute these numbers. > > On Dec 3, 12:09 pm, Harshal <hc4...@gmail.com> wrote: > > Nc2 * N-1c2 * N-2c2 * ..... * 2c2. > > > > where Nc2 means the number of combinations that can be made out of N > numbers > > taken 2 at a time. After merging any 2 companies, you will have N-1 > > companies left, and so on. If I interpreted the question correct, this is > my > > solution. Any more ideas? > > > > harsh > > -- > 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. > > -- yezhu malai vaasa venkataramana Govinda Govinda -- 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.
