> For the complete documentation index, see [llms.txt](https://soumyajit4419.gitbook.io/ds-algo/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://soumyajit4419.gitbook.io/ds-algo/binary-search/template-iii.md).

# Template III

It is used to **search for an element or condition** which requires ***accessing the current index** and its i**mmediate left and right neighbor's index*** in the array.<br>

**Key Attributes:**

* An alternative way to implement Binary Search
* Search Condition needs to access element's immediate left and right neighbors.
* Use element's neighbors to determine if condition is met and decide whether to go left or right.
* Gurantees Search Space is at least 3 in size at each step.

**Distinguishing Syntax:**

* Initial Condition: `left = 0, right = length-1`
* Termination: `left + 1 == right`
* Searching Left: `right = mid`
* Searching Right: `left = mid`