Try this exercise. Is this statement true or false?

Quick Sort is a divide-and-conquer sorting algorithm that works by selecting a pivot and partitioning the array into two sub-arrays, according to the elements smaller and larger than the pivot.