Ternary Search
← Back to Searching
A search algorithm that divides the search space into three parts. Primarily used to find the maximum or minimum of a unimodal function.
Key Properties
Related
- Binary Search (related divide-and-conquer approach)
← Back to Searching
A search algorithm that divides the search space into three parts. Primarily used to find the maximum or minimum of a unimodal function.