OCaml mergesort and time
问题 I created a function (mergesort) in ocaml but when I use it, the list is inverted. In addition, I want to calculate the time the system takes to do the calculation, how can I do it? let rec merge l x y = match (x,y) with | ([],_) -> y | (_,[]) -> x | (h1::t1, h2::t2) -> if l h1 h2 then h1::(merge l t1 y) else h2::(merge l x t2);; let rec split x y z = match x with | [] -> (y,z) | x::resto -> split resto z (x::y);; let rec mergesort l x = match x with | ([] | _::[]) -> x | _ -> let (pri,seg) =