F# Quicksort
Kategorie
der Vorteil einer
Funktionalen Sprache ist, dass er schön kurz ist.
Gruß JJR
let rec quicksort list =
match list with
| [] ->
[]
| firstElem::otherElements ->
let smallerElements =
otherElements
|> List.filter (fun e -> e < firstElem)
|> quicksort
let largerElements =
otherElements
|> List.filter (fun e -> e >= firstElem)
|> quicksort
smallerElements @ [firstElem] @largerElements
let rand = System.Random()
let data = List.init 50 (fun x -> rand.Next())
printfn "%A" (quicksort data)
System.Console.ReadLine()
Gruß JJR
let rec quicksort list =
match list with
| [] ->
[]
| firstElem::otherElements ->
let smallerElements =
otherElements
|> List.filter (fun e -> e < firstElem)
|> quicksort
let largerElements =
otherElements
|> List.filter (fun e -> e >= firstElem)
|> quicksort
smallerElements @ [firstElem] @largerElements
let rand = System.Random()
let data = List.init 50 (fun x -> rand.Next())
printfn "%A" (quicksort data)
System.Console.ReadLine()