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
Suppose you have given N companies, and we want to eventually merge
them into one big company. How many ways are theres to merge?
--
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.
