*solved 1. The problem statement, all variables and given/known data Lets say we have three algorithms, which include the following complexities 200n, 3n^2, 2^n-1. What would be a combined algorithm which is efficient? 2. Relevant equations 3. The attempt at a solution Let me know if I'm on the right path here. 100n+3n^2 + 2^(n-1) =log(100n)+log(3n^2)+log(2^(n-1)) =[log(100) + log(n)]+[log(3)+log(n^2)]+[(n-1)*log(2)] =[log(100) + log(n)]+log(n^2)+(n-1),exclude constants =log(n)+2log(n)+n =(3log(n)+n) The efficiency of the combined algorithm is O(3log(n)).