This solution is from what I can tell the same as many others. Why is it performing worse? Any thoughts? Thank You!

```
public int FindPeakElement(int[] nums) {
int left = 0;
int right = nums.Length - 1;
while (left < right)
{
int mid = (left + right)/2;
int midNext = mid + 1;
if (nums[mid] < nums[midNext])
{
left = midNext;
}
else
{
right = mid;
}
}
return left;
}
```