162 find peak element (logarithmic complexity and smart looping !)

#linear search
def findPeakElement(self, nums):
        for i in range(len(nums)-1):
            if nums[i] > nums[i+1]: #otherwise we let i pass since we only interested in peak !!
                return i
        return len(nums)-1
    
    #binary search
    def findPeakElement(self, nums):
        left,right = 0,len(nums)-1
        while left < right:
            middle = int((left+right)/2)
            if nums[middle] > nums[middle+1]:  #we focus on the bigger element side(remember what fall/up slope looks like) !
                right = middle
            elif nums[middle] < nums[middle+1]:
                left = middle + 1
        if left == right:
            return left