How to pronounce the complexity of an algorithm

84 Views Asked by At

I have a few questions regarding complexity:

  • How do you name this complexity: $ f(M,D) = O(M^D) $. Is it f is exponential in D and what exactly in M, polynomial?

  • Just to confirm $ f(M,D) = O(MD)$ is linear in both M and D, right?

  • Also is $f(M,D) = O(M^2D + M^2) = O(M^2D)$?

Thanks!