pepcoding.com 19/10/2021 pivotInSortedAndRotatedArray

code.cpp

#include<bits/stdc++.h>
using namespace std;
void input(vector<int> &arr)
{
    for (int i = 0; i < arr.size(); i++)
    {
        cin >> arr[i];
    }
 }
 int findpivot(vector<int>&arr)
 {
     int lo=0;
     int hi=arr.size()-1;
     while(lo<hi)
     {
         int mid=(lo+hi)/2;
         if(arr[mid]<arr[hi])
         {
             hi=mid;
         }
         else if(arr[mid]>arr[hi])
         {
             lo=mid+1;
         }
     }
     
     return arr[hi];
 }
 int main()
 {
     int n;
     cin>>n;
     vector<int> vec(n,0);
     input(vec);
     int pivot=findpivot(vec);
     cout<<pivot;
     return 0;
 }

code.py

def findpivot(arr):
    lo=0;hi=len(arr)-1;
    while lo<hi:
        mid=(lo+hi)//2;
        if(arr[mid]<arr[hi]):
            hi=mid;
        elif(arr[mid]>arr[hi]):
            lo=mid+1;
    return arr[hi];
    
n=int(input());
arr=[];
for i in range(0,n):
    val=int(input());
    arr.append(val);
pivot=findpivot(arr);
print(pivot);

snippet.cpp

#include <bits/stdc++.h>
using namespace std;
void input(vector<int> &arr)
{
    for (int i = 0; i < arr.size(); i++)
    {
        cin >> arr[i];
    }
}
int findpivot(vector<int> &arr)
{
    //write your code here
}
int main()
{
    int n;
    cin >> n;
    vector<int> vec(n, 0);
    input(vec);
    int pivot = findpivot(vec);
    cout << pivot;
    return 0;
}

snippet.py

def findpivot(arr):
    #write your code here
    
n=int(input());
arr=[];
for i in range(0,n):
    val=int(input());
    arr.append(val);
pivot=findpivot(arr);
print(pivot);