In: Computer Science
***Only Complete the Bolded Part of the Question***
Complete the asymptotic time complexity using Master theorem, then use the "Elimination Method" to validate your solution.
1. T(n)= T(7n/10) + n
By using the Master method, we get the time complexity for the recurrence relation.
T(n) = T(7n/10) + n = O(n) or theta(n).
Now, let us also solve it using the elimination method to validate our result from the master's method.
The answer is in the images attached below with proper explanation and documentation.