Run Code
|
API
|
Code Wall
|
Users
|
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
Please
log in
to post a comment.
(Int,Int) -> Bool plot
Reader
equiv_strings
equiv
project euler 7, haskell
Pascal's triangle in 10 lines
Derive type class for parameterized data type
Haskell remove item by index
Sierpinski Triangle as lazy list
project euler 5, haskell
Please log in to post a comment.