What is wrong with this code

#1

#include
using namespace std;
int find(int arr[],int n)
{int s=0;
int e=n-1;
if(arr[0]<=arr[n-1])
{
return 0;
}
while(s<=e)
{ int mid=(s+e)/2;
if(arr[mid]>arr[mid+1])
{
return arr[mid+1];
}
else if(arr[s]<=arr[mid])
{
s=mid+1;
}
else{
e=mid-1;
}
}
return 0;
}
int main() {
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
cout<<find(arr,n);
return 0;
}

#2

@Kunalgoyal you should return the index of pivot!
so return mid and not arr[mid+1].