A

Admin • 833.24K Points
Coach

Q. 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

  • (A) f(n) x g(n)
  • (B) max ( f(n),g(n))
  • (C) min (f(n),g(n))
  • (D) f(n) + g(n)

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.