Run Code
|
Code Wall
|
Users
|
Misc
|
Feedback
|
About
|
Login
|
Theme
|
Privacy
Quicksort in Haskell
Language:
Ada
Assembly
Bash
C#
C++ (gcc)
C++ (clang)
C++ (vc++)
C (gcc)
C (clang)
C (vc)
Client Side
Common Lisp
D
Elixir
Erlang
F#
Fortran
Go
Haskell
Java
Javascript
Kotlin
Lua
MySql
Node.js
Ocaml
Octave
Objective-C
Oracle
Pascal
Perl
Php
PostgreSQL
Prolog
Python
Python 3
R
Ruby
Scala
Scheme
Sql Server
Swift
Tcl
Visual Basic
Editor:
CodeMirror
EditArea
Simple
Layout:
Vertical
Horizontal
--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]
ghc
Show compiler warnings
[
+
] Compiler args
[
+
]
Show input
Compilation time: 0.33 sec, absolute running time: 0.14 sec, cpu time: 0 sec, memory peak: 2 Mb, absolute service time: 0.62 sec
edit mode
|
history
|
discussion
[-1,-1,0,1,5,10,20]