Ternary Search - Basic Algorithms Fast (16)

Let's learn ternary search, which is a divide-and-conquer approach. There are 4 indices - low, mid1, mid2, high - used to determine one of the 3 intervals to further divide. The selection ends when mid1 or mid2 equals the target, or the high index is smaller than the low index.

2:22 - Case when the target is found
5:41 - Case when the target is not found

Playlist of my Algorithm walkthrough

Basic Python Fast

Playlist of my Python examples

Playlist of my Java course

Playlist of my Java examples

#ternarysearch #algorithm #begincodingfast #algorithmvisualization