diff --git a/Contributors.html b/Contributors.html
index 0c7036042a..c8b9a682cf 100644
--- a/Contributors.html
+++ b/Contributors.html
@@ -101,8 +101,6 @@ <h1 class="animated rubberBand delay-4s">Contributors</h1>
 
 
 
-
-
 	      <!-- Add to the bottom of the list -->
 <a class="box-item" href="https://github.com/fineanmol"><span>Anmol Agarwal</span></a>
 <a class="box-item" href="https://github.com/Amitava123"><span>Amitava Mitra</span></a>
@@ -154,6 +152,7 @@ <h1 class="animated rubberBand delay-4s">Contributors</h1>
 <a class="box-item" href="https://github.com/evergreen2001"><span>Ido Evergreen</span></a> 
 <a class="box-item" href="https://github.com/Zaheudev"><span>Zaharia Iulian</span></a> 
 <a class="box-item" href="https://github.com/haryanapnx"><span>Haryfun</span></a>
+<a class="box-item" href="https://github.com/Alok-873"><span>Alok Tripathi</span></a>
 <a class="box-item" href="https://github.com/qdtroemner"><span>Quentin Troemner</span></a> 
 <a class="box-item" href="https://github.com/vikramadityasinghs"><span>Vikramaditya Singh Saxena</span></a> 
 
diff --git a/Program's_Contributed_By_Contributors/ExponentialSearching.cpp b/Program's_Contributed_By_Contributors/ExponentialSearching.cpp
new file mode 100644
index 0000000000..65092e078a
--- /dev/null
+++ b/Program's_Contributed_By_Contributors/ExponentialSearching.cpp
@@ -0,0 +1,48 @@
+// C++ program to find an element x in a 
+// sorted array using Exponential search. 
+#include <bits/stdc++.h> 
+using namespace std; 
+
+int binarySearch(int arr[], int, int, int); 
+
+int exponentialSearch(int arr[], int n, int x) 
+{ 
+	if (arr[0] == x) 
+		return 0; 
+	int i = 1; 
+	while (i < n && arr[i] <= x) 
+		i = i*2; 
+
+	return binarySearch(arr, i/2, min(i, n), x); 
+} 
+
+int binarySearch(int arr[], int l, int r, int x) 
+{ 
+	if (r >= l) 
+	{ 
+		int mid = l + (r - l)/2; 
+
+		if (arr[mid] == x) 
+			return mid; 
+
+		if (arr[mid] > x) 
+			return binarySearch(arr, l, mid-1, x); 
+
+		return binarySearch(arr, mid+1, r, x); 
+	} 
+
+	return -1; 
+} 
+
+// Driver code 
+int main(void) 
+{ 
+int arr[] = {2, 3, 4, 10, 40}; 
+int n = sizeof(arr)/ sizeof(arr[0]); 
+int x = 10; 
+int result = exponentialSearch(arr, n, x); 
+(result == -1)? printf("Element is not present in array") 
+				: printf("Element is present at index %d", 
+													result); 
+return 0; 
+}