Insertion Sort F#

isort.fs

let insert (a: array<int>) i item =
    let mutable i = i - 1
    while i >= 0 && item < a.[i] do
        a.[i + 1] <- a.[i]
        i <- i - 1
    a.[i + 1] <- item

let isort (a: array<int>) =
    let a = Array.copy a
    for i in 1 .. (a.Length - 1) do
        insert a i a.[i]
    a