The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
104 views
T(n)=2T(log n)+c

 c is a constant. Base condition is if(n<2) return 1

What will be the tightest bound on time complexity?
asked in Algorithms by (23 points) | 104 views

2 Answers

0 votes
logn?
answered by Junior (863 points)
0 votes

Ans:Theta(n2)

 

 

Explanation is in the image

 

 

Hope this is the answer,Thnak you for your question :)

answered by (165 points)

Related questions

+4 votes
1 answer
1
0 votes
0 answers
2
0 votes
0 answers
3


Quick search syntax
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

29,138 questions
36,959 answers
92,026 comments
34,803 users