0 votes 0 votes closed as a duplicate of: complexity What should be the approch to solve these relations? Consider the recurrence relation T(n) = T(n–1) + T(n/2) + n. Which of the following is a good tight upper bound on T(n) (A) Θ(n2) (B) Θ(n2 log n) (C) Θ(2 (log n)2) (D) Θ(n (log n)2) Algorithms algorithms recurrence-relation + – Purple asked Jan 26, 2016 • closed Jan 26, 2016 by Arjun Purple 234 views comment Share Follow See all 0 reply Please log in or register to add a comment.