min ele in rotated array

Author: geeky01adarsh

Searching/README.md

@@ -29,7 +29,7 @@
 |2| [Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array/)|[Solution](single_element_in_sorted_array.cpp)|
 |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|
+|5| [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)|[Solution](min_in_rotated_arr.cpp)|
 |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|

Searching/min_in_rotated_arr.cpp

@@ -0,0 +1,44 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int findMin(vector<int> &num)
+{
+    if (num.empty())
+        return 0;
+    int low = 0;
+    int high = num.size() - 1;
+    int mid;
+
+    while (low < high)
+    {
+        mid = (low + high) / 2;
+        if (num[low] > num[mid])
+        {
+            low++;
+            high = mid;
+        }
+        else if (num[mid] > num[high])
+        {
+            low = ++mid;
+        }
+        else
+            high = mid;
+    }
+
+    return num[low];
+}
+
+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 << findMin(v) << endl;
+    return 0;
+}