0 0 votes Algorithms time-complexity algorithms + – HeadShot 1.7k views answer comment Share Follow Print See all 13 Comments 13 13 Comments reply Show 10 previous comments kumar.dilip commented Dec 2, 2018 reply Follow flag 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 0 replyShare Chaitrasj commented Dec 2, 2018 reply Follow flag @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 0 replyShare Gate Fever commented Dec 2, 2018 reply Follow flag @kumar.dilip exactly i was also getting 247 but they have given 248; however i strongly feel that it must be 247 0 0 replyShare Please log in or register to add a comment.
