Created
July 11, 2012 09:15
-
-
Save jmaicher/3089218 to your computer and use it in GitHub Desktop.
Quicksort in Haskell with intensional defined lists
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
quicksort [] = [] | |
quicksort (x:xs) = | |
quicksort [ y | y <- xs, y < x ] ++ | |
[x] ++ | |
quicksort [ y | y <- xs, y >= x ] |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment