Suppose that you have two different algorithms for solving a problem. To solve a problem of size n, the first algorithm uses exactly n22n operations and the second algorithm uses exactly n! operations. As n grows, which algorithm uses fewer operations?
Solution:Step 1In this problem we have to find which algorithm uses fewer operation for solving a problem as grows. If the first algorithm uses operation and the second algorithm uses operation To solve a problem of size .To solve this problem we have to use concept of growth of function and we will use inequality to solve this problem.