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

2 Answers

0 votes
logn?
answered by Junior (821 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)  

Related questions



Top Users Sep 2017
  1. Habibkhan

    6338 Points

  2. Warrior

    2220 Points

  3. Arjun

    2158 Points

  4. nikunj

    1980 Points

  5. manu00x

    1726 Points

  6. SiddharthMahapatra

    1718 Points

  7. Bikram

    1716 Points

  8. makhdoom ghaya

    1660 Points

  9. A_i_$_h

    1518 Points

  10. rishu_darkshadow

    1512 Points


25,981 questions
33,556 answers
79,371 comments
31,014 users