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

2 Answers

0 votes
logn?
answered by Junior (721 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 May 2017
  1. akash.dinkar12

    3598 Points

  2. pawan kumarln

    2314 Points

  3. Bikram

    1958 Points

  4. Arjun

    1942 Points

  5. sh!va

    1682 Points

  6. Debashish Deka

    1296 Points

  7. Devshree Dubey

    1282 Points

  8. Arunav Khare

    1122 Points

  9. Angkit

    1072 Points

  10. LeenSharma

    1028 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 May 29 - Jun 04
  1. Arjun

    292 Points

  2. Arunav Khare

    246 Points

  3. Rupendra Choudhary

    116 Points

  4. Arnab Bhadra

    116 Points

  5. pC

    110 Points


22,912 questions
29,253 answers
65,411 comments
27,750 users