title: Peak element in an array in c
body: <p>I am given an array of integers. I have to find a peak element in it.
  An array element is peak if it is <strong>NOT smaller</strong> than its neighbors.
  For corner elements,consider only one neighbor. </p>
  
  <p>For example:</p>
  
  <p>For input array <code>{10, 20, 15, 2, 23, 90, 67}</code>
  there are two peak elements: 20 and 90. I need to return any one peak element.</p>
  
  <p>The solution i tried is a linear scan of array and i found a peak element. The worst case time complexity of this method would be O(n).</p>
  
  <p>Can we find the peak element in worst time complexity better than O(n)?</p>