data structures - Algorithms and time complexity

Question

I have a program with order of 'n!' and takes n^3 seconds to solve problem of input size n.estimate how long it will take with input size m.Write algorithm for above scenario.

i found that it will take (n^3/n!)(m) but am unable to write algoritm for same

Answer 1

等待大神解答