MadeEasy Test Series 2018: Algorithms - Reccurence

Kindly help in solving the following recurrence relation. Solution is given by using Master's Theorem but can it be applied when the parameter 'b' is not an integer?IF no...

Subham Nagar

376 views

Subham Nagar asked Jan 26, 2018

Algorithms
algorithms
recurrence-relation
made-easy-test-series

+ –

1 votes

2 answers

Utk asked Jan 20, 2016

500 views

MadeEasy Test Series: Algorithms - Time Complexity
$T(n)=2T(\frac{n}{2})+n\log n$ for n>=2 and T(1)=0, then T(n) is (a.) $O(n)$ (b.) $O(n \log n)$ (c.) $O( n (\log n)^{2})$ (d.) $O(n^{2})$ Answer given is (c.) The solution is done using subsitution, n = $2^{k}$ But if we do with Master's theorem, then we will get option (b.) and this a case for Master's theorem, right?

$T(n)=2T(\frac{n}{2})+n\log n$ for n>=2 and T(1)=0, then T(n) is(a.) $O(n)$(b.) $O(n \log n)$(c.) $O( n (\log n)^{2})$(d.) $O(n^{2})$ Answer given is (c.) The solution is...

Utk

500 views

Utk asked Jan 20, 2016

Algorithms
made-easy-test-series
algorithms
time-complexity
recurrence-relation

+ –

2 votes

1 answer

charul asked Nov 11, 2017

702 views

MadeEasy Subject Test: Algorithms - Recurrence

charul

702 views

charul asked Nov 11, 2017

Algorithms
made-easy-test-series
algorithms
recurrence-relation
time-complexity

+ –

1 votes

1 answer

Singhravin11 asked Apr 26, 2016

8,604 views

How to solve reccurence relation of type t(n)=t(n/5)+t(7n/10)+n ?plz specify in detail.

Singhravin11

8.6k views

Singhravin11 asked Apr 26, 2016

Algorithms
algorithms
recurrence-relation

+ –

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

2 2 Comments reply

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Related questions

2 2 Comments