Cpp-codes/BitonicPoint.cpp at main · learnsomethingtoday/Cpp-codes · 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
62
63
64
65
//contributing for hacktoberfest2021
//array and searching cpp code

#include <bits/stdc++.h>

using namespace std;


 // } Driver Code Ends
//User function template for C++
class Solution{
public:

	int findMaximum(int arr[], int n) {
	    // code here
	    int start=0;
	    int end=n-1;
	    if(n==1)
	        return arr[0];
	    while(start<=end){
	        int mid=start+(end-start)/2;
	        if(mid>0 && mid<n-1){
	            if(arr[mid]>arr[mid+1] && arr[mid]>arr[mid-1])
	                return arr[mid];
	           else if(arr[mid-1]>arr[mid])
	                end=mid-1;
	           else
	                start=mid+1;
	        }
	        else if(mid==0){
	            if(arr[0]>arr[1])
	                return arr[0];
	           else
	                return arr[1];
	        }
	        else if(mid==n-1){
	            if(arr[n-1]>arr[n-2])
	                return arr[n-1];
	           else
	                return arr[n-2];
	        }
	    }
	    return arr[0];
	}
};

// { Driver Code Starts.

int main() {
    int t;
    cin >> t;
    while (t--) {
        int n, i;
        cin >> n;
        int arr[n];
        for (i = 0; i < n; i++) {
            cin >> arr[i];
        }
        Solution ob;
        auto ans = ob.findMaximum(arr, n);
        cout << ans << "\n";
    }
    return 0;
}
  // } Driver Code Ends