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

2 Answers

0 votes
logn?
answered by Junior (711 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 Mar 2017
  1. rude

    5246 Points

  2. sh!va

    3054 Points

  3. Rahul Jain25

    2920 Points

  4. Kapil

    2732 Points

  5. Debashish Deka

    2602 Points

  6. 2018

    1574 Points

  7. Vignesh Sekar

    1440 Points

  8. Bikram

    1432 Points

  9. Akriti sood

    1420 Points

  10. Sanjay Sharma

    1128 Points

Monthly Topper: Rs. 500 gift card

21,553 questions
26,902 answers
61,258 comments
23,269 users