Skip to content

Instantly share code, notes, and snippets.

@freeman42x
Created February 3, 2021 11:29
Show Gist options
  • Save freeman42x/46f2a396fe3ec787b37907864b0b90fa to your computer and use it in GitHub Desktop.
Save freeman42x/46f2a396fe3ec787b37907864b0b90fa to your computer and use it in GitHub Desktop.
Haskell inefficient but readable QuickSort
qsort [] = []
qsort (p:xs) = qsort lesser ++ [p] ++ qsort greater
where lesser = filter (< p) xs
greater = filter (>= p) xs
-- Made you look at Haskell Ria :p
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment