#Binary Search

How would you implement a binary search algorithm? Please explain the logic behind it.

Solve a tricky binary search problem that goes beyond the typical element-finding tasks. You will need to apply binary search with insight into the specific problem constraints.

Given an array of integers sorted in non-decreasing order, find the starting and ending position of a target value. If the target is not found, return [-1, -1].

Describe the divide-and-conquer approach used in binary search and provide an implementation in your chosen language.