Created
June 17, 2012 00:46
-
-
Save posaunehm/2943026 to your computer and use it in GitHub Desktop.
An quick sort implementation by F#
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| let rec qSort (x : List<'a>) = | |
| if x.Length <= 1 then x | |
| else | |
| let parted = x.Tail |> List.partition (fun i -> i < x.Head) | |
| List.append (fst parted |> qSort) (x.Head::(snd parted |> qSort)) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment