Dear Geeks,
Could you please help me to solve following problem. For instance.
First sorted elements: P1 P2 P4 P5
Second sorted elements: D1 D4 D2 D5
The number of elements in each lists are arbitrary but number of
elements in First list is equal to Second list. The problem is how
many ways
Hi,
Although, I cannot give you a complete solution right now..I will give you
the following relations (I am not sure If they are correct.discussions
welcome)
T(0, x) = 1
T(x, 0) = 1
T(1, x) = (x+1)
T(x, 1) = (x+1)
T(n, m) = Sum[i=0..n] { T(n-i, m-2) * (i+1) }
If you are looking for a
Thank you Karthik for your effort. I figure out lately that My
question is not that much logical. Actually there will be only one
possible combination that we can easily get as we have already got the
sorted lists.
On 7/17/07, Karthik Singaram L [EMAIL PROTECTED] wrote:
Hi,
Although, I
