So let's look at T(n) = 2 * T(n - 1) + T(n/2) + 1/2 .
Let us compare this to the recurrence relation where the smaller terms are stripped:
S(n) = 2 * T(n - 1)
We can obviously see that
T(n) = Ω(S(n))
so it only remains to show that S(n) = Ω(2 n ) .
Let us expand S(n) :
S(n) = 2 * T(n - 1)
= 2 * 2 * T(n - 2)
= 2 * 2 * 2 * T(n - 3)
We notice that we obtain 2 * 2 *... * 2 = 2 n .
Therefore, S(n) = Ω(2 n ) and thus T(n) = Ω(S(n)) = Ω(2 n ) . □
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.