<br />Quick Sort is a divide and conquer algorithm.<br /> <br />erlang code:<br />%implements the partition method. Just for demonstration. Actually you can use BIF lists:partition(Cmp, List).part([], _, Smaller, Larger) -> {Smaller, Larger};part([H|L]