It's a divide-and-conquer sorting algorithm that selects a pivot element and partition the array into two parts, with elements smaller than the pivot on one side and elements larger on the other. The two parts are then recursively sorted.