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
与恶龙缠斗过久,自身亦成为恶龙；凝视深渊过久,深渊将回以凝视…
