diff --git a/Searching Algorithms/ternarySearch.cpp b/Searching Algorithms/ternarySearch.cpp
new file mode 100644
index 00000000..e497de07
--- /dev/null
+++ b/Searching Algorithms/ternarySearch.cpp	
@@ -0,0 +1,35 @@
+//Ternary Search Uses Divide And Conquer Technique
+#include<iostream>
+
+/*
+ * Part of Cosmos by OpenGenus Foundation
+*/
+
+using namespace std;
+int ternarySearch(int arr[],int l,int r, int x){
+    if(r>=l){
+        int mid1 = l + (r-l)/3;
+        int mid2 = r - (r-l)/3;
+        if(arr[mid1] == x)
+            return mid1;
+        /*
+            In this search, after each iteration it neglects (1/3)rd part of the array and repeats the same operations on the remaining 2/3rd 		    part of array 
+        */
+        if(arr[mid2] == x)
+            return mid2;
+        if(x<arr[mid1])
+            return ternarySearch(arr,l,mid1-1,x);
+        else if(x>arr[mid2])
+            return ternarySearch(arr,mid2+1,r,x);
+        else
+            return ternarySearch(arr,mid1+1,mid2-1,x);
+    }
+    return -1; // if x is not found in array arr
+}
+int main(){
+   int arr[] = {1, 2, 3, 5};
+   int size = sizeof(arr)/ sizeof(arr[0]);
+   int find = 3;
+   cout<<"Position of "<<find<<" is "<<ternarySearch(arr,0,size-1,find);
+   return 0;
+}