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

Popular posts from this blog

xslt - DocBook 5 to PDF transform failing with error: "fo:flow" is missing child elements. Required content model: marker* -

mediawiki - How do I insert tables inside infoboxes on Wikia pages? -

Local Service User Logged into Windows -