Ternary Search

Divides a sorted range into three parts with two midpoints, discarding two-thirds each step.