Algorithm design technique used in quicksort algorithm is?

The quicksort algorithm employs the divide and conquer design technique. It works by selecting a pivot element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. The sub-arrays are then sorted recursively.