Cant u slit it s n/2 companies and merge them recursively .like x^y the multiply x to y/2 time and then multiply tht product twice.....
On Sat, Jul 31, 2010 at 6:59 PM, sourav <[email protected]> wrote: > Suppose we start with n companies that eventually merge into one big > company. How many different ways are there for them to merge? > > With three companies {a,b,c}, we need to find the number of ways that > the three companies can become two companies, and for every one of > those possibilities, the two remaining companies can be reduced to one > in only 1 way (because we've already solved the case of two > companies). In the case of {a,b,c}, we can have 1 * [{ab,c}, {ac,b}, > {bc,a}], or 3. > > -- > 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. > > -- 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 [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.
