Question: 5. For finding an item in a sorted array, consider tertiary search, which is similar to binary search. It compares array elements at two locations

5. For finding an item in a sorted array, consider tertiary search," which is similar to binary search. It compares array elements at two locations and elminiates 2/3 of the array. To analyze the number of comparisons, the recur- rence equations are T(n) = 2+T(n/3), T(2) = 2, and T(1) = 1, where n is the size of the array. Explain why the equations characterize "tertiary search and solve for T(n)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
