Log in for answers tailored to you — saved chats, your topics, and the full IJR suite.
IJR.ai — Intelligence belongs to everyone
Topic
ternary search
0 members
Overview
A ternary search algorithm is a technique in computer science for finding the minimum or maximum of a unimodal function.
The function
Assume we are looking for a maximum of and that we know the maximum lies somewhere between and . For the algorithm to be applicable, there must be some value such that
for all with , we have , and
for all with , we have .
Algorithm