Question: 12 pts D Question 15 The ternary search algorithm is a modification of the binary search algorithm that splits the input not into two sets

12 pts D Question 15 The ternary search algorithm is a modification of the binary search algorithm that splits the input not into two sets of almost-equal sizes, but into three sets of sizes approximately one-third. a) Write verbally describe and give pseudo-code for the ternary search algorithm. (b) Give the recurrence for the ternary search algorithm and determine the asymptotic running time of your algorithm. HTML Editor
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
