peak in mountain array

Author: geeky01adarsh

Searching/README.md

@@ -10,7 +10,7 @@
 |5| [Arranging Coins(Easy)](https://leetcode.com/problems/arranging-coins/)|[Solution](arranging_coin.cpp)|
 |6| [Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target/)|[Solution](smallest_letter_greater_than_target.cpp)|
 |7| [Kth Missing Positive Number](https://leetcode.com/problems/kth-missing-positive-number/)|[Solution](kth_missing_positive_no.cpp)|
-|8| [Search Insert Position](https://leetcode.com/problems/search-insert-position/)|Pending|
+|8| [Search Insert Position](https://leetcode.com/problems/search-insert-position/)|[Solution](search_insert_position.cpp)|
 |9| [Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array/)|Pending|
 |10| [Count Negative Numbers in a Sorted Matrix](https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/)|Pending|
 |11| [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)|Pending|

Searching/peak_in_mountain_array.cpp

@@ -0,0 +1,38 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int peakIndexInMountainArray(vector<int> &arr)
+{
+    // linear search
+    // for(int i=0; i<arr.size()-1; i++){
+    //     if(arr[i]>arr[i+1]) return i;
+    // }
+    // return arr.size()-1;
+
+    // binary search
+    int l = 0, r = arr.size() - 1, mid;
+    while (l < r)
+    {
+        mid = (l + r) / 2;
+        if (arr[mid] < arr[mid + 1])
+            l = mid + 1;
+        else
+            r = mid;
+    }
+    return l;
+}
+
+int main()
+{
+    int n;
+    cin >> n;
+    vector<int> v;
+    for (int i = 0; i < n; i++)
+    {
+        int temp;
+        cin >> temp;
+        v.push_back(temp);
+    }
+    cout<<peakIndexInMountainArray(v)<<endl;
+    return 0;
+}