123456789101112131415161718192021222324252627282930313233343536373839

class Solution {
    // Function to find a peak element using binary search
    public int findPeakElement(int[] nums) {
        // Set left and right bounds
        int low = 0, high = nums.length - 1;

        // Binary search loop
        while (low < high) {
            // Find mid point
            int mid = (low + high) / 2;

            // If mid element is greater than next
            if (nums[mid] > nums[mid + 1]) {
                // Move to left half
                high = mid;
            } else {
                // Move to right half
                low = mid + 1;
            }
        }

        // Return peak index
        return low;
    }
}

public class Main {
    public static void main(String[] args) {
        // Input array
        int[] nums = {1, 2, 1, 3, 5, 6, 4};

        // Create object
        Solution obj = new Solution();

        // Output result
        System.out.println(obj.findPeakElement(nums));
    }
}

12345678910111213141516171819202122232425262728293031

class Solution:
    # Function to find a peak element using binary search
    def findPeakElement(self, nums):
        # Set left and right bounds
        low, high = 0, len(nums) - 1

        # Binary search loop
        while low < high:
            # Find mid point
            mid = (low + high) // 2

            # If mid element is greater than next
            if nums[mid] > nums[mid + 1]:
                # Move to left half
                high = mid
            else:
                # Move to right half
                low = mid + 1

        # Return peak index
        return low

# Input array
nums = [1, 2, 1, 3, 5, 6, 4]

# Create object
obj = Solution()

# Output result
print(obj.findPeakElement(nums))

1234567891011121314151617181920212223242526272829303132333435

class Solution {
    // Function to find a peak element using binary search
    findPeakElement(nums) {
        // Set left and right bounds
        let low = 0, high = nums.length - 1;

        // Binary search loop
        while (low < high) {
            // Find mid point
            let mid = Math.floor((low + high) / 2);

            /