Quicksort works by$.$

Oa$.$ Iterating through the array and finding the minimum$/$maximum element

Ob$.$ Inserting elements into their correct positions directly

Oc Dividing the array into smaller sub$-$arrays, sorting them, and then combining them

Od$.$ Comparing adjacent elements and swapping them if they are in the wrong order