insertion_sort.ml

open Printf

let fetch_ints (size : int) : int array =
  Array.init size (fun x -> read_int())

let insertion_sort = 
  let size = read_int() in
  let sizep = pred size
  and arr = fetch_ints size in
  let x = arr.(sizep) in
  let rec i_s arr i =
    let ip = i-1 in
    if arr.(ip) > x then (
      arr.(i) <- arr.(ip);
      Array.iter (printf "%d ") arr;
      Printf.printf "\n";
      i_s arr ip
    ) else (
      arr.(i) <- x;
      Array.iter (printf "%d ") arr
    );
  in i_s arr sizep;;