Ternary Search divides the search space into three parts by calculating two midpoints (mid1 and mid2). It compares the target with these points to narrow down the search to one of three segments, repeating until the target is found or the space is exhausted.
Divides the search space in three parts.
Efficient on Uniform Data
More complex computation per step
Best suited for medium-sized datasets, requires a sorted array.