Quicksort in Haskell

firephil · Mar 14, 2021 · 2bd8b7d · 2bd8b7d
1 parent be6415e
commit 2bd8b7d
Show file tree

Hide file tree

Showing 2 changed files with 8 additions and 0 deletions.
diff --git a/.idea/vcs.xml b/.idea/vcs.xml
diff --git a/Quicksort.hs b/Quicksort.hs
@@ -1,5 +1,7 @@
 import Data.List (partition)
 
+# on line implementation
+
 qsort1 [] = []
 qsort1 (x:xs) = qsort1 [y | y <- xs, y < x] ++ [x] ++ qsort1 [y | y <- xs, y >= x]