0 votes 0 votes I came across a term solving a Recurrence Relation using recursion method and it was - 2log(n) = n. How's this being solved? Thanks. Algorithms algorithms recurrence-relation time-complexity + – iarnav asked Mar 30, 2018 iarnav 456 views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments iarnav commented Mar 31, 2018 reply Follow Share Mast hai Bhai, Thanks! 1 votes 1 votes Tesla! commented Apr 1, 2018 reply Follow Share amazing method but we can also solve this by using the property of log $a^{log _{b}c} = c^{log _{b}a}$ so $2^{log _{2}n} = n^{log _{2}2}$ and we know $log_{2}2=1$ so n$^{1}$ 2 votes 2 votes iarnav commented Apr 1, 2018 reply Follow Share @Tesla! Thanks Brother! :) 0 votes 0 votes Please log in or register to add a comment.