Ternary search is a divide-and-conquer search algorithm that is used to find the maximum or minimum value of a unimodal function. A unimodal function is defined as one that has a single local maximum or minimum within a given interval. Ternary search divides the search interval into three parts, which results in two midpoints, and then eliminates one of the three segments based on the comparison of the function values at these midpoints.
Articles by others on the same topic
There are currently no matching articles.