Question: 1. Write recursive Binary search algorithm. Show how it works on A = {2, 8, 11, 12, 19, 22, 30, 36}, searching for x =
1. Write recursive Binary search algorithm. Show how it works on A = {2, 8, 11, 12, 19, 22, 30, 36}, searching for x = 25.
2. Solve using the master method (full or special case): T(n) = 3T(2n/3) + 1, for n > 1, T(1) = 1.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
