Find peak element in an array

Focus on developing an efficient algorithm to find a peak element in the array. Start by clarifying the definition of a peak element and discuss edge cases, such as arrays with only one element or those that are strictly increasing or decreasing. Consider using a binary search approach to optimize for time complexity, aiming for O(log n) if possible. Be prepared to explain your thought process, including how you would handle different scenarios and ensure that your solution is robust. Finally, discuss the trade-offs of your chosen approach, including time and space complexity.