Quick sort

Drag and drop the lines into the box on the right. This version is highly memory inefficient compared to an 'inplace' algorithm that swaps data within an array. Also, as a recursive algorithm, it will be less efficient than an equivalent purely iterative version.