0 votes 0 votes T(n) = 2^nT(n/2) + n^n find TC Algorithms algorithms time-complexity + – mohdraza asked Sep 1, 2022 • retagged Sep 26, 2022 by Shubham Sharma 2 mohdraza 269 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply shishir__roy commented Sep 6, 2022 i edited by gatecse Sep 6, 2022 reply Follow Share @samarpita how did you solve this, did you directly apply master's theorem? 0 votes 0 votes samarpita commented Sep 7, 2022 reply Follow Share @shishir__roy i made mistake, i forgot that a is constant. 0 votes 0 votes Please log in or register to add a comment.