Merge pull request #48 from Vivek13121/main

Implement Fibonacci search algorithm

Author: admirerr

CPP/dynamic-programming/egg_dropping_problem.cpp

@@ -0,0 +1,29 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int eggDrop(int eggs, int floors) {
+    vector<int> dp(floors + 1, 0), prev(floors + 1, 0);
+
+    for (int e = 1; e <= eggs; e++) {
+        for (int f = 1; f <= floors; f++) {
+            if (e == 1) {
+                dp[f] = f; 
+            } else {
+                dp[f] = INT_MAX;
+                for (int k = 1; k <= f; k++) {
+                    int res = 1 + max(prev[k - 1], dp[f - k]);
+                    dp[f] = min(dp[f], res);
+                }
+            }
+        }
+        prev = dp;
+    }
+    return dp[floors];
+}
+
+int main() {
+    int eggs = 2, floors = 10;
+    cout << "Minimum number of trials in worst case: " 
+         << eggDrop(eggs, floors) << endl;
+    return 0;
+}

Python/searching/fibonacci_search.py

@@ -0,0 +1,37 @@
+def fibonacci_search(arr, x):
+    n = len(arr)
+    f2 = 0
+    f1 = 1
+    f = f1 + f2
+
+    while f < n:
+        f2 = f1
+        f1 = f
+        f = f1 + f2
+
+    offset = -1
+
+    while f > 1:
+        i = min(offset + f2, n - 1)
+
+        if arr[i] < x:
+            f = f1
+            f1 = f2
+            f2 = f - f1
+            offset = i
+        elif arr[i] > x:
+            f = f2
+            f1 = f1 - f2
+            f2 = f - f1
+        else:
+            return i
+
+    if f1 and offset + 1 < n and arr[offset + 1] == x:
+        return offset + 1
+
+    return -1
+
+arr = [10, 22, 35, 40, 45, 50, 80, 82, 85, 90, 100]
+target = 85
+result = fibonacci_search(arr, target)
+print(f"Target {target} found at index: {result}")