Build your intuition. Fill in the missing part by typing it in.

Choose a random element from the array as a pivot and swap pivot with the last element of the array. Initialize two pointers left and right pointing to the start and end of the array.

This principle is implemented in which type of sorting algorithm?