Quick sort is a divide and conquer sorting algorithm that works by selecting a pivot element, then partitions this element into the rest of the array where larger values are to its right, and smaller values are to its left. This is done recursively to sort an array.