DSA_CH/elmentSearch.cpp at master · Arshlan-Raza/DSA_CH · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
#include<iostream>

using namespace std;

int binarySearch(int arr[], int n , int k,int s,int e){

    // int s = 0 , e = n - 1;

    int  mid = s + (e - s)/2;

    while(s<=e){
        if(arr[mid] == k){
            return mid;
        }
        else if(k > arr[mid]){
            s = mid + 1;
        }
        else{
            e = mid - 1;
        }
        mid = s + (e - s)/2;
    }
    return -1;
}

int getpivot(int arr[], int n,int k){

    int s =0,e = n - 1;

    int mid = s + (e-s)/2;

    while(s<e){


        if(arr[mid]>=arr[0]){
            s = mid+1;
        }

        else{
            e = mid;
        }

        mid = s + (e-s)/2;
    }

    if(k<=arr[n-1] && k>=arr[s]){
        binarySearch(arr,n,k,s,n-1);
    }
    else{
        binarySearch(arr,n,k,0,s-1);
    }

}

int main(){

    int arr[5] = {7,9,10,1,2};

    cout<<"The pivot Index is at : "<<getpivot(arr,5,1);

}