0 votes 0 votes Algorithms time-complexity algorithms + – HeadShot asked Dec 1, 2018 • retagged Jun 11, 2022 by makhdoom ghaya HeadShot 787 views answer comment Share Follow See all 13 Comments See all 13 13 Comments reply Show 10 previous comments kumar.dilip commented Dec 2, 2018 reply Follow Share For Ramesh T(n) = T(n/2) + c. T(n) = logn. For Suresh T(n) = 2*T(n/2) + c T(n) = n-1 Then 255 - 8 = 247 . 0 votes 0 votes Chaitrasj commented Dec 2, 2018 reply Follow Share @Gate Fever no, exact number of function calls is not 8. anyhow in this we need to go by solving recurrence relation so no need to check no of func calls 0 votes 0 votes Gate Fever commented Dec 2, 2018 reply Follow Share @kumar.dilip exactly i was also getting 247 but they have given 248; however i strongly feel that it must be 247 0 votes 0 votes Please log in or register to add a comment.
