Answer by
arrakaij (24)

Quicksort is a recursive sorting algorithm following the 'divide et impera' scheme. it takes an element (token) of the list that is to sort and transfers every element that smaller on the one side and everything that is bigger on the other.
for the whole list, the algorithm is used on the two parts again until the list is sorted.