you can do similar stuff in elixir which is kinda half-way python (maybe ruby) and haskell (b/c built on erlang) # Base case: empty list def quicksort([]), do: [] # Recursive case: split & sort def quicksort([pivot | rest]) do lesser = Enum.filter(rest, &(&1 <

→ View original post on X — @andreasklinger