diff --git a/Searching/Cpp/MinimumElementIndex.cpp b/Searching/Cpp/MinimumElementIndex.cpp
new file mode 100644
index 0000000..ac9c88e
--- /dev/null
+++ b/Searching/Cpp/MinimumElementIndex.cpp
@@ -0,0 +1,36 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+// Input array is sorted rorated and find the minimum element index.
+
+int minimum(vector<int>& a, int n) {
+    int low = 0;
+    int high = n-1;
+    cout<<low<<" "<<high<<endl;
+    while (low < high) {
+        int mid = low + (high - low) / 2;
+        if (a[mid] == a[high])
+            high--;
+        else if (a[mid] > a[high])
+            low = mid + 1;
+        else
+            high = mid;
+    }
+    return high;
+}
+
+
+int main() 
+{
+    int n; 
+    cin>>n;
+    vector<int> v;
+    for(int i=0;i<n;i++){
+        int x;
+        cin>>x;
+        v.push_back(x);
+    }
+    
+    cout<<"Index :\n"<<minimum(v,n)<<endl;
+    return 0;
+}