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

View Code

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