retagged by
369 views

1 Answer

Best answer
2 votes
2 votes
I believe 17 is a constant which will not make a noticable difference when we compute Time complexity of this function. so we can ignore it.

T(n)= 2T(n/2) + n

now you can apply Master's theroem

answer will be theeta(nlogn)
selected by

Related questions

0 votes
0 votes
0 answers
2
0 votes
0 votes
1 answer
4
akash.dinkar12 asked Apr 5, 2019
279 views
Can the master method be applied to the recurrence $T(n)=4T(n/2)+n^2\ lg\ n$ ?Why or why not? Give an asymptotic upper bound for this recurrence.