Just getting started with Elixir and trying to implement Quick-sort algorithm using recursion. It seems like everything works but keying in this [8,16,3,7,23,77,9,30] broke the flow.
I was expecting [3, 7, 8, 9, 16, 23, 77, 30] but I did get this
[3, 7, 8, 16, 23, 77, 9, 30].
Also did a google search and saw other solutions calling filter or partition fro Enum module, I’m keen on using list comprehension implementing it.
Here is the code.
defmodule Quick do
def sort([]), do: []
def sort([head|tail]) do
less_than_head = for x <- tail, x <= head, do: x
greater_than_head = for x <- tail, x > head, do: x
sort(less_than_head) ++ [head] ++ (greater_than_head)
end
end
please do advice and how I can improve it.
