The quick sort algorithm sorts using what technique?

Hi!

The Quicksort algorithm uses a divide-and-conquer approach.

Explanation:

The Quicksort algorithm follows these steps to sort:

It is accomplished by dividing the array into two partitions. Sorting each partition recursively. The array is partitioned by placing all items smaller than some pivot item before that item and all items larger than the pivot item after it.