An algorithm is made up of two independent time complexities f (n) and g (n). Then the complexities of the algorithm is in the order of
1. f(n) x g(n)
2. max ( f(n),g(n))
3.min (f(n),g(n))
4. f(n) + g(n)
Answer:2
Posted Date:-2022-07-06 14:03:25