Mixing
Solving $f(n) = n log(n)$ using this version of Master theorem.
Clash Royale CLAN TAG#URR8PPP
up vote
0
down vote
favorite
I am trying to solve this $T(n)= 2T(n/2) + nlog(n)$ using this version of master theorem in my lecture notes:
But I cannot be able to solve it. But if I use other version master theorem found on net, one example wiki's
I am able to solve this question using case 2. So which theorem is to use? And there are different case 2 solutions for different Master Theorem versions. Which is the best to apply? I am quite confused.
Thanks.
algorithms recurrence-relations
edited Jul 19 at 9:53
thesmallprint
2,2191617
asked Jul 19 at 9:19
engkhsky
465
add a comment |Â
up vote
0
down vote
favorite
I am trying to solve this $T(n)= 2T(n/2) + nlog(n)$ using this version of master theorem in my lecture notes:
But I cannot be able to solve it. But if I use other version master theorem found on net, one example wiki's
I am able to solve this question using case 2. So which theorem is to use? And there are different case 2 solutions for different Master Theorem versions. Which is the best to apply? I am quite confused.
Thanks.
algorithms recurrence-relations
edited Jul 19 at 9:53
thesmallprint
2,2191617
asked Jul 19 at 9:19
engkhsky
465
Well, if the second theorem is more detailed, then why not use that? There is no "one" Master Theorem, and instead of worrying about finding the right one it is always easier to derive the solution by hand.
– Michal Adamaszek
Jul 19 at 18:01
add a comment |Â
up vote
0
down vote
favorite
up vote
0
down vote
favorite
I am trying to solve this $T(n)= 2T(n/2) + nlog(n)$ using this version of master theorem in my lecture notes:
But I cannot be able to solve it. But if I use other version master theorem found on net, one example wiki's
I am able to solve this question using case 2. So which theorem is to use? And there are different case 2 solutions for different Master Theorem versions. Which is the best to apply? I am quite confused.
Thanks.
algorithms recurrence-relations
edited Jul 19 at 9:53
thesmallprint
2,2191617
asked Jul 19 at 9:19
engkhsky
465
I am trying to solve this $T(n)= 2T(n/2) + nlog(n)$ using this version of master theorem in my lecture notes:
But I cannot be able to solve it. But if I use other version master theorem found on net, one example wiki's
I am able to solve this question using case 2. So which theorem is to use? And there are different case 2 solutions for different Master Theorem versions. Which is the best to apply? I am quite confused.
Thanks.
algorithms recurrence-relations
edited Jul 19 at 9:53
thesmallprint
2,2191617
asked Jul 19 at 9:19
engkhsky
465
edited Jul 19 at 9:53
thesmallprint
2,2191617
edited Jul 19 at 9:53
thesmallprint
2,2191617
edited Jul 19 at 9:53
thesmallprint
2,2191617
2,2191617
asked Jul 19 at 9:19
engkhsky
465
asked Jul 19 at 9:19
engkhsky
465
asked Jul 19 at 9:19
engkhsky
465
465
Well, if the second theorem is more detailed, then why not use that? There is no "one" Master Theorem, and instead of worrying about finding the right one it is always easier to derive the solution by hand.
– Michal Adamaszek
Jul 19 at 18:01
add a comment |Â
Well, if the second theorem is more detailed, then why not use that? There is no "one" Master Theorem, and instead of worrying about finding the right one it is always easier to derive the solution by hand.
– Michal Adamaszek
Jul 19 at 18:01
Well, if the second theorem is more detailed, then why not use that? There is no "one" Master Theorem, and instead of worrying about finding the right one it is always easier to derive the solution by hand.
– Michal Adamaszek
Jul 19 at 18:01
Well, if the second theorem is more detailed, then why not use that? There is no "one" Master Theorem, and instead of worrying about finding the right one it is always easier to derive the solution by hand.
– Michal Adamaszek
Jul 19 at 18:01
add a comment |Â
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2856436%2fsolving-fn-n-logn-using-this-version-of-master-theorem%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Well, if the second theorem is more detailed, then why not use that? There is no "one" Master Theorem, and instead of worrying about finding the right one it is always easier to derive the solution by hand.
– Michal Adamaszek
Jul 19 at 18:01