ocaml: phase 5.1 zigzag.ml baseline (interleave two lists, sum 1..10 = 55)

One-liner that swaps the lists on every recursive call:

  let rec zigzag xs ys =
    match xs with
    | [] -> ys
    | x :: xs' -> x :: zigzag ys xs'

This works because each call emits the head of xs and recurses with
ys as the new xs and the rest of xs as the new ys.

  zigzag [1;3;5;7;9] [2;4;6;8;10] = [1;2;3;4;5;6;7;8;9;10]   sum = 55

Tests recursive list cons + arg-swap idiom that is concise but
non-obvious to readers expecting symmetric-handling.

68 baseline programs total.

lib/ocaml/baseline/expected.json

@@ -61,6 +61,7 @@
   "subset_sum.ml": 8,
   "tic_tac_toe.ml": 1,
   "word_freq.ml": 8,
+  "zigzag.ml": 55,
   "zip_unzip.ml": 1000,
   "sieve.ml": 15,
   "sum_squares.ml": 385,

lib/ocaml/baseline/zigzag.ml

@@ -0,0 +1,8 @@
+let rec zigzag xs ys =
+  match xs with
+  | [] -> ys
+  | x :: xs' -> x :: zigzag ys xs'
+
+;;
+
+List.fold_left (+) 0 (zigzag [1;3;5;7;9] [2;4;6;8;10])