Solve the recurrence relation: T(n) = 3 T(n/2) + n^{1.5} log n

- All categories
- Asymptotic Analysis (22)
- Divide & Conquer (9)
- Greedy Algorithms (2)
- Dynamic Programming (7)
- Backtracking/DFS/BFS (2)
- Branch & Bound (2)
- Graph Theory (15)
- NP-Completeness (4)

...

edited May 4 by zhouce