here is my code

```
class Solution {
public:
int findMin(vector<int> &num) {
return findMinRecursion(num,0,num.size()-1);
}
int findMinRecursion(vector<int> &num,int l,int r)
{
if(l==r) return num[r];
if(num[l]<num[r]) return num[l];
else{
int mid=(l+r)>>1;
int minL=findMinRecursion(num,l,mid);
int minR=findMinRecursion(num,mid+1,r);
return min(minL,minR);
}
}
};
```

since my code doesn't take fully use of the middle index element, and I used min() function, it's different from other's code. I'm confused, is it log(n) time complexity?