Added new algorithms

Author: jeevanshu

DP/Egg Dropping Puzzle/egg_dropping_puzzle.cpp

@@ -0,0 +1,48 @@
+
+#include <iostream>
+
+#define MAX_EGGS 100
+#define MAX_FLOORS 100
+#define INF 1000000000
+
+using namespace std;
+
+int memo[MAX_EGGS][MAX_FLOORS];
+
+/*
+ *  Returns the minimum number of attempts
+ *  needed in the worst case for n eggs
+ *  and k floors.
+ *  Time complexity: O(n*k^2)
+ */
+int eggDrop(int n, int k) {
+    
+    if(k == 0) return 0; 
+    if(k == 1) return 1; 
+    if(n == 1) return k; 
+
+
+    if(memo[n][k] > -1) return memo[n][k]; 
+
+    int ans = INF;
+    for(int h = 1; h <= k; ++h) {
+        
+        ans = min(ans, max(    
+            eggDrop(n-1, h-1), 
+            eggDrop(n, k-h)    
+        ));
+    }
+
+    return memo[n][k] = ans + 1; 
+}
+
+int main() {
+    
+    memset(memo, -1, sizeof memo);
+
+    cout << eggDrop(2, 100) << '\n';
+    cout << eggDrop(10, 5) << '\n';
+    cout << eggDrop(10, 100) << '\n';
+    return 0;
+}
+

DP/Tiling Problem/tiling.cpp

@@ -0,0 +1,24 @@
+#include<iostream>
+#include<vector>
+using namespace std;
+
+long long tiling(int n)
+{
+	vector<long long int> tile(n+1);
+	
+	tile[0]=1;
+	tile[1]=1;
+	tile[2]=2;
+	for(int i=3;i<=n;i++)
+	{
+		tile[i]=tile[i-1]+tile[i-2];
+	}
+	return tile[n];
+}
+
+int main()
+{   int n;
+	cout<<"enter the value of n\n";
+	cin>>n;
+	cout<<"total ways to arrange the tiles is "<<tiling(n);
+}

Search/EcponentialSearch/exponentialsearch.cpp

@@ -0,0 +1,44 @@
+
+#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;
+}
+ 
+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;
+}