Algorithms

player1 = {endurance:5,ovr:7},
player2 = {endurance:9,ovr:3},

<pre lang="C#">
Adam works in the in networking security cell. He wants to generate secret keys
following a pattern. The pattern consists of the characters X and Y.
where X means increasing and Y means decreasing. Help him devise an
algorithm to generate the secret key which is the minimum number encoded
following that pattern. Digits from 1-9 and digits can’t repeat.

Sample Input:                                   Sample Output:

X                                                   12
YXYX                                             21435
YYXYYXXY                                    321654798
</pre>

when using master theorem

i know that a = the number of subproblems
b = size of the subproblem
d = time takes to combine the solutions

when b, the size of the subproblem is given as n-1, a = 2, d=1

how do you work out T(n)??

What I have tried:

T(n) = aT(n/b) + O(n)

T(n) = 4T(n-1) + O(n)

b3 43 67 9a 52 8a bb ef f8 d6 f5 c4 b0 5e f8 17 64 a9 55 cb 5b 17 cc e8 ba e7 32 0f a8 04 cf e0 
f8 32 57 02 ca b7 88 66 69 c2 d7 0c bd 0e 46 84 98 c8 21 bd 92 b1 5d 27 a3 49 6c 80 58 0d f0 ce 
cf 84 10 dd f5 f0 49 9a 80 70 23 51 f2 0e c2 f4 f5 77 e1 51 64 39 8e ee 8f a8 d1 b7 db fe aa d8 
01 e0 aa 81 1d 69 ae