for i in range(n):
some_sort(Array a, a + mid) # Will be called n times.
some_sort(Array, b-mid, b) # Will be called n times.
some_sort(Array, a + (mid+1)//2, b - (mid+1)//2) # Will be called n times.
T(n) = n * T(n / 2) + n * T(n / 2) + n * T(n / 2) + O(1)
T(n) = 3 * n * T(n / 2) + O(1)
假设
some_sort(A)
的时间复杂度为T(n)
。你知道吗时间复杂度:T(n/2)
时间复杂度:T(n/2)
时间复杂度:T(n/2)
利用马斯特斯定理我们得到:
相关问题 更多 >
编程相关推荐