Thursday, 6 April 2017

Geeksforgeeks Solution For " Search in a Rotated Array "

GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of  School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers 

Problem :- Search in a Rotated Array

Submit Your Solution :- Click Here 

Solution :- 

#include <iostream>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
       int n,i,k,tmp;
       cin>>n;
       int arr[n];
       for(i=0;i<n;i++)
       {
           cin>>arr[i];
       }
       cin>>k;
       for(i=0;i<n;i++)
       {
           if(arr[i]==k)
           {
               tmp=i;
               break;
           }
           else
           {
               tmp=0;
           }
       }
       if(tmp!=0)
       {
        cout<<tmp<<"\n";   
       }
       else
       {
        cout<<"-1\n";   
       }
    }
    return 0;
}

Output:-



Geeksforgeeks Solution For " Search in a Rotated Array "

No comments:
Write comments

Recommended Posts × +