ocaml: phase 5.1 egg_drop.ml baseline (2 eggs, 36 floors -> 8 trials)

Classic egg-drop puzzle DP:

  dp[e][f] = 1 + min over k in [1, f] of
              max(dp[e-1][k-1], dp[e][f-k])

For 2 eggs over 36 floors, the optimal worst-case is 8 trials
(closed form: triangular number bound).

Tests 2D DP with triple-nested for-loops, max-of-two via inline
if, large sentinel constant (100000000), mixed shifted indexing
(e-1) and (f-k) where both shift independently.

163 baseline programs total.

lib/ocaml/baseline/egg_drop.ml

@@ -0,0 +1,26 @@
+let egg_drop eggs floors =
+  let dp = Array.init (eggs + 1) (fun _ -> Array.make (floors + 1) 0) in
+  for f = 1 to floors do
+    dp.(1).(f) <- f
+  done;
+  for e = 1 to eggs do
+    dp.(e).(0) <- 0;
+    dp.(e).(1) <- 1
+  done;
+  for e = 2 to eggs do
+    for f = 2 to floors do
+      let best = ref 100000000 in
+      for k = 1 to f do
+        let bre = dp.(e - 1).(k - 1) in
+        let sur = dp.(e).(f - k) in
+        let cand = 1 + (if bre > sur then bre else sur) in
+        if cand < !best then best := cand
+      done;
+      dp.(e).(f) <- !best
+    done
+  done;
+  dp.(eggs).(floors)
+
+;;
+
+egg_drop 2 36

lib/ocaml/baseline/expected.json

@@ -29,6 +29,7 @@
   "count_change.ml": 406,
   "count_inversions.ml": 12,
   "csv.ml": 10,
+  "egg_drop.ml": 8,
   "dijkstra.ml": 7,
   "exception_handle.ml": 4,
   "exception_user.ml": 26,