📌  相关文章
📜  排序时间复杂度 - 无论代码示例

📅  最后修改于: 2022-03-11 15:00:16.260000             🧑  作者: Mango

代码示例1
Suppose tA =O (n) and tB = θ (n2). 
Then, the  total computation time can be calculated as

Computation Time = tA + tB
 = (max (tA,tB)
 = (max (O (n), θ (n2)) = θ (n2)