Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Quicksort in Haskell
--Quicksort main = print $ f [1, 20, 10, 0, -1, 5, -1] f [] = [] f (x:xs) = f ys ++ [x] ++ f zs where ys = [a | a <- xs, a <=x] zs = [b | b <- xs, b > x]
run
|
edit
|
history
|
help
0
ReaderPractice
Reader
Znajdz trójkąty prostokątne
Token
folder
project euler 1, haskel
mapper
haskell
Removed input
project euler 8, haskell