Quick Sort

A divide and conquer sorting algorithm. It picks one element as the pivot, moves the smaller elements to the left of the pivot and the bigger ones to the right, then sorts each side the same way, recursively. Its time complexity is O(N log N) in the best case and O(N²) in the worst case, which usually happens when the pivot is the smallest or biggest element, so scattered pivots perform better. Bianca explains it step by step, with a video, in her article on whether Quick Sort lives up to its name.