What is the runtime complexity if T(n)= n*T(n-1)? -
What is the runtime complexity if T(n)= n*T(n-1)? -
should utilize tree solve ? or there easiest way solve it? think n! right?
thank you.
using recurrence relations, may this:
runtime asymptotic-complexity
Comments
Post a Comment