Quick Sort
Definition one of sort algorithms The most important sort algorithm Use this algorithm anywhere with any languages The best way to avoid worst time complexity is pick pivot randomly. if program most not have $O(n^2)$, need to use other sorting algorithm. Technique Decrease and Conquer Algorithm steps Recusively loop based on Lomuto. pick pivot the most right element. left side will be smaller than pivot value and right side will be bigger than pivot.