Quick Sort §

Group: 5 #group-5

Relations §

• Sorting: Quick Sort is a divide and conquer algorithm that picks an element as a pivot and partitions the given array around the pivot.