quicksort algorithm

Quicksort is a way of arranging things in order by comparing them one by one. It is a type of sorting algorithm, a set of instructions for organizing things in order. To use quicksort, you have to pick a spot in the list of things and call it the "pivot". Then, you look at all the other items and put them in 2 piles: one pile has all the items that are smaller than the pivot and the other pile has all the items that are bigger than the pivot. Once the piles are made, you sort each pile using quicksort again, until all the items are sorted. Then, you combine the two sorted piles and everything is in order!