61B-18: Asymptotics II HHZZ included in UCB-CS61B 2024-07-13 18 words One minute Contents 没有捷径,全靠仔细 for loops recursion binary search merge sort 没有捷径,全靠仔细 for loops recursion 形如Θ(nk)\Theta(n^k)Θ(nk), kkk 是递归的深度 binary search 形如Θ(logn)\Theta(\log n)Θ(logn) C(N) = ⌊log2(N)⌋+1 merge sort 形如Θ(nlogn)\Theta(n\log n)Θ(nlogn)