Sorting algorithms/Quicksort: Difference between revisions
Content added Content deleted
(Added module to reuse for Compare sorting algorithms' performance) |
|||
| Line 1,028: | Line 1,028: | ||
=={{header|Erlang}}== |
=={{header|Erlang}}== |
||
like haskell |
like haskell. |
||
Used by [[Measure_relative_performance_of_sorting_algorithms_implementations]]. If changed keep the interface or change [[Measure_relative_performance_of_sorting_algorithms_implementations]] |
|||
| ⚫ | |||
<lang erlang> |
|||
-module( quicksort ). |
|||
-export( [qsort/1] ). |
|||
| ⚫ | |||
qsort([X|Xs]) -> |
qsort([X|Xs]) -> |
||
qsort([ Y || Y <- Xs, Y < X]) ++ [X] ++ qsort([ Y || Y <- Xs, Y >= X]). |
qsort([ Y || Y <- Xs, Y < X]) ++ [X] ++ qsort([ Y || Y <- Xs, Y >= X]). |
||
</lang> |
|||
=={{header|F Sharp|F#}}== |
=={{header|F Sharp|F#}}== |
||