Find Peak Element using Binary Search in O(log n)

Описание: We use binary search to find a peak by comparing each middle element with its next. If the array is increasing at mid, a peak exists on the right; if decreasing, it's on the left. Since adjacent elements are always different, there's always at least one peak. The search space narrows until low equals high — this index is the peak.
#findPeakElement, #binarysearch, #arraylogic, #logn, #codingexplanation, #dsa, #leetcode, #techwalkthrough, #peakelement, #algorithmexplained