GATE CSE
First time here? Checkout the FAQ!
x
0 votes
78 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 (15 points)   | 78 views

2 Answers

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

Ans:Theta(n2)

 

 

Explanation is in the image

 

 

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

answered by (155 points)  


Top Users Jul 2017
  1. Bikram

    3960 Points

  2. manu00x

    2464 Points

  3. Debashish Deka

    1848 Points

  4. joshi_nitish

    1654 Points

  5. Arjun

    1290 Points

  6. Hemant Parihar

    1184 Points

  7. Arnab Bhadra

    1100 Points

  8. Shubhanshu

    1052 Points

  9. Ahwan

    900 Points

  10. rahul sharma 5

    702 Points


24,018 questions
30,955 answers
70,327 comments
29,337 users