GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
93 views
  • T(n) = T(log n) + c
  • T(n) = T(log n) + log n
asked in Algorithms by Active (1.2k points)   | 93 views

For 

  • T(n) = T(log n) + c 
       T(n)=log*n
Can  u plz  show how ?

yes......
see how our problem of size n is reducing...like
  n -> logn ->loglogn -> loglogn ..................-> 1
it must b need 2 give there that T(1) is constant 
now see defn of log*n "In computer science, the iterated logarithm of n, written log* n (usually read "log star"), is the number of times the logarithm function must be iteratively applied before the result is less than or equal to 1. "
  so there r log*n such iterations nd cost of each is c hence it is clog*n

Please log in or register to answer this question.



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

    108 Points

  5. pawan kumarln

    108 Points


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