## Sorting Algorithm - Quick Sort

QuickSort is also a Divide And Conquer algorithm with a performance of $O(n * log(n))$, however in the worst case this becomes $O(n^2)$. How We start by picking an element which is called the pivot, then we will rearrange the array so that every element smaller than...