Quicksort algorithm is based on which algorithm design technique?

Quicksort uses the Divide and Conquer technique. It works by selecting a pivot element and partitioning the array into two subarrays: one with elements less than the pivot and one with elements greater than the pivot. This process is applied recursively to each subarray until the entire array is sorted.