1 votes 1 votes Algorithms master-theorem recurrence-relation time-complexity test-series + – shweta sah asked Jun 15, 2018 • retagged Jul 16, 2022 by makhdoom ghaya shweta sah 345 views answer comment Share Follow See 1 comment See all 1 1 comment reply vikas kumar 2 commented Jun 15, 2018 reply Follow Share A,b are not possible because ,2^n is exponential, and sin(n) is transclant function , But we are trying to find polynomial 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes C,. because T(n)=aT(n/b)+f(n) Where f(n) is polynomial fn vikas kumar 2 answered Jun 15, 2018 vikas kumar 2 comment Share Follow See 1 comment See all 1 1 comment reply shweta sah commented Jun 15, 2018 reply Follow Share Why option a and b cannot be the answer 0 votes 0 votes Please log in or register to add a comment.