0 votes 0 votes T(n) = 2T( n / root(2)) + n T(1) = O(1) when i solve this i get theta ( n ^ log 2 base root(2)) using masters theorem after this how do i slove Algorithms asymptotic-notation + – A_i_$_h asked Sep 18, 2017 retagged Jun 10, 2022 by makhdoom ghaya A_i_$_h 305 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Habibkhan commented Sep 18, 2017 reply Follow Share nlog√22 = n2 only which is greater than f(n) as f(n) = n Hence T(n) = n2 1 votes 1 votes A_i_$_h commented Sep 18, 2017 reply Follow Share sorry i dint get u 0 votes 0 votes prateekdwv commented Sep 18, 2017 reply Follow Share $n^{\log_{\sqrt{2}}{2}} = n^{\log_{\sqrt{2}}{\sqrt{2}}^2}=n^{2\log_{\sqrt{2}}{\sqrt{2}}}=n^2$ 1 votes 1 votes A_i_$_h commented Sep 18, 2017 reply Follow Share thank u :) 0 votes 0 votes Please log in or register to add a comment.