0 votes 0 votes T(n)=2T(log n)+c c is a constant. Base condition is if(n<2) return 1 What will be the tightest bound on time complexity? Algorithms time-complexity algorithms asymptotic-notation + – Naveen Pandey asked Jan 8, 2017 Naveen Pandey 487 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Ans:Theta(n2) Explanation is in the image Hope this is the answer,Thnak you for your question :) MallikarjunM answered Jan 19, 2017 MallikarjunM comment Share Follow See all 0 reply Please log in or register to add a comment.