ocaml: phase 5.1 monotonic.ml baseline (monotonicity check, 4/5 inputs monotonic)
Some checks failed
Test, Build, and Deploy / test-build-deploy (push) Failing after 23s

Tracks two bool refs (inc, dec). For each pair of consecutive
elements: if h < prev clear inc, if h > prev clear dec. Returns
inc OR dec at the end:

  let is_monotonic xs =
    match xs with
    | [] -> true
    | [_] -> true
    | _ ->
      let inc = ref true in
      let dec = ref true in
      let rec walk prev rest = ... in
      (match xs with h :: t -> walk h t | [] -> ());
      !inc || !dec

Five test cases:
  [1;2;3;4]    inc only        true
  [4;3;2;1]    dec only        true
  [1;2;1]      neither          false
  [5;5;5]      both (constant)  true
  []            empty            true (vacuous)
  sum = 4

98 baseline programs total.
This commit is contained in:
2026-05-09 19:37:11 +00:00
parent be13f2daba
commit 14575a9cd7
3 changed files with 37 additions and 0 deletions

View File

@@ -59,6 +59,7 @@
"merge_sort.ml": 44, "merge_sort.ml": 44,
"merge_two.ml": 441, "merge_two.ml": 441,
"module_use.ml": 3, "module_use.ml": 3,
"monotonic.ml": 4,
"newton_sqrt.ml": 1414, "newton_sqrt.ml": 1414,
"mutable_record.ml": 10, "mutable_record.ml": 10,
"option_match.ml": 5, "option_match.ml": 5,

View File

@@ -0,0 +1,25 @@
let is_monotonic xs =
match xs with
| [] -> true
| [_] -> true
| _ ->
let inc = ref true in
let dec = ref true in
let rec walk prev rest =
match rest with
| [] -> ()
| h :: t ->
if h < prev then inc := false;
if h > prev then dec := false;
walk h t
in
(match xs with h :: t -> walk h t | [] -> ());
!inc || !dec
;;
(if is_monotonic [1;2;3;4] then 1 else 0) +
(if is_monotonic [4;3;2;1] then 1 else 0) +
(if is_monotonic [1;2;1] then 1 else 0) +
(if is_monotonic [5;5;5] then 1 else 0) +
(if is_monotonic [] then 1 else 0)

View File

@@ -407,6 +407,17 @@ _Newest first._
binary search tree (`type 'a tree = Leaf | Node of 'a * 'a tree * binary search tree (`type 'a tree = Leaf | Node of 'a * 'a tree *
'a tree`) with insert + in-order traversal. Tests parametric ADT, 'a tree`) with insert + in-order traversal. Tests parametric ADT,
recursive match, List.append, List.fold_left. recursive match, List.append, List.fold_left.
- 2026-05-09 Phase 5.1 — monotonic.ml baseline (monotonicity check,
4/5 inputs monotonic). Tracks two bool refs (inc, dec). Each pair
of consecutive elements: if `h < prev` clear `inc`, if `h > prev`
clear `dec`. Empty list and singleton are vacuously true. Five
test cases:
[1;2;3;4] inc only true
[4;3;2;1] dec only true
[1;2;1] neither false
[5;5;5] both (constant) true
[] empty true (vacuous)
Sum = 4. 98 baseline programs total.
- 2026-05-09 Phase 5.1 — majority_vote.ml baseline (Boyer-Moore - 2026-05-09 Phase 5.1 — majority_vote.ml baseline (Boyer-Moore
majority, [3;3;4;2;4;4;2;4;4] → 4). O(n) time / O(1) space: majority, [3;3;4;2;4;4;2;4;4] → 4). O(n) time / O(1) space:
candidate-and-count refs; on match increment, on mismatch candidate-and-count refs; on match increment, on mismatch