# 大师定理-最好的情况下大哦？

• bby 回复

Depending on your conditions, Masters theorem gives either the worst-case time complexity `Big-O` or a tight bound `Big-Theta`

Now the actual proof of Master's theorem involves drawing the recurrence tree and some approximations using the geometric series progression. Here's a link to a pdf containing the process.