A ternary search algorithm is a technique in computer science for finding the minimum or maximum of a unimodal function. Wikipedia