2 votes 2 votes T(n) = T(log n) + c T(n) = T(log n) + log n Algorithms algorithms time-complexity + – Anjana Babu asked Jan 1, 2017 Anjana Babu 486 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply saurabh rai commented Jan 1, 2017 reply Follow Share For T(n) = T(log n) + c T(n)=log*n 0 votes 0 votes Anjana Babu commented Jan 1, 2017 reply Follow Share Can u plz show how ? 0 votes 0 votes saurabh rai commented Jan 1, 2017 reply Follow Share 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 1 votes 1 votes saurabh rai commented Jan 1, 2017 reply Follow Share http://math.stackexchange.com/questions/1944401/solve-recurrence-tn-tlogn-logn 1 votes 1 votes Please log in or register to add a comment.