问题:
[单选题]
If an algorithm has running time T(n)=O(nlogn), then T(n) may most likely satisfy that _____.
AT(n)=4T(n/4)+O(n2)
BT(n)=4T(n/4)+O(n)
CT(n)=3T(n/2)+O(n)
DT(n)=2T(n/2)+O(logn)
If an algorithm has running time T(n)=O(nlogn), then T(n) may most likely satisfy that _____.
AT(n)=4T(n/4)+O(n2)
BT(n)=4T(n/4)+O(n)
CT(n)=3T(n/2)+O(n)
DT(n)=2T(n/2)+O(logn)
Copyright © 2024 www.daanwo.com All Rights Reserved |