gaodansoft

//快速排序 open System let rec QuickSort(xs:List) = match xs with |[] -> [] |[a] -> [a] |(x::xs) -> let smaller= QuickSort(xs |>List.filter(fun e->eList.filter(fun e->...

F#实现的归并排序   //此算法只是原理，不能真正应用 open System printfn "dsfsadsf" let Merge(x,y)= (x@y)|>List.sort //自上而下深度优先 let rec MergeSortUp (sortList:List<int>)= match sortList with ...