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 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 program, then you can code this up...If you are
> looking for a closed form solution, this needs to be tidied up.
>
>
> >
>
--
Rupesh Bhochhibhoya, [EMAIL PROTECTED]
Oklahoma State University
Stillwater, OK 74075
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
