find peak element

Author: geeky01adarsh

Searching/README.md

@@ -30,7 +30,7 @@
 |3| [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)|Pending|
 |4| [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/)|Pending|
 |5| [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)|Pending|
-|6| [Find Peak Element](https://leetcode.com/problems/find-peak-element/)|Pending|
+|6| [Find Peak Element](https://leetcode.com/problems/find-peak-element/)|[Solution](peak_ele.cpp)|
 |7| [Find Right Interval](https://leetcode.com/problems/find-right-interval/)|Pending|
 |8| [Reach a Number](https://leetcode.com/problems/reach-a-number/)|Pending|
 |9| [Maximum Value at a Given Index in a Bounded Array](https://leetcode.com/problems/maximum-value-at-a-given-index-in-a-bounded-array/)|Pending|

Searching/peak_ele.cpp

@@ -0,0 +1,33 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int findPeakElement(vector<int> &num)
+{
+    int low = 0, high = num.size() - 1;
+    while (low < high - 1)
+    {
+        int mid = (low + high) / 2;
+        if (num[mid] > num[mid - 1] && num[mid] > num[mid + 1])
+            return mid;
+        else if (num[mid] > num[mid + 1])
+            high = mid - 1;
+        else
+            low = mid + 1;
+    }
+    return num[low] > num[high] ? low : high;
+}
+
+int main()
+{
+    int n, target;
+    cin >> n;
+    vector<int> v;
+    for (int i = 0; i < n; i++)
+    {
+        int temp;
+        cin >> temp;
+        v.push_back(temp);
+    }
+    cout << findPeakElement(v) << endl;
+    return 0;
+}