An algorithm to solve a given problem has time complexity T(n) = nlog2n-(n-1) Given that the algorithm

admin2009-07-15  1

问题 An algorithm to solve a given problem has time complexity                       T(n) = nlog2n-(n-1)     Given that the algorithm takes 0.8 second for a problem in which n=1024, how long should it take for a problem in which n=4096? (    )

选项 A、39 seconds
B、0.8 seconds
C、3.9 minutes
D、3.9 seconds

答案D

解析
转载请注明原文地址:https://jikaoti.com/ti/pDE7FFFM
0

相关试题推荐
最新回复(0)