0 votes 0 votes Give a big-O estimate for the function $f$ in question $10$ if $f$ is an increasing function. Combinatory kenneth-rosen discrete-mathematics counting recurrence-relation descriptive + – admin asked May 9, 2020 admin 347 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes By substituting we get f(2) = 2 ; f(4) = 3 ; f(8) = 4 ; and so on therefore f(2^k ) = k+1 ; and f(n) = log n + 1 hence function complexity = O(log n ) anurag sharma answered Aug 9, 2020 anurag sharma comment Share Follow See all 0 reply Please log in or register to add a comment.