F#基础算法——插入排序

    let insertSort (num: int array)=
        for i=1 to num.Length-1 do
            let mutable temp=num.[i]
            for j=i-1 to 0 do
                if num.[j]>temp then
                    num.[j+1]<-num.[j]
                num.[j+1]<-temp