Quick Sort
Quick Sort is a highly efficient sorting algorithm that employs the divide and conquer strategy. It is widely used due to its efficiency and general applicability. The core operation involves pivot partitioning, where an element called the pivot is selected, and the array is rearranged so that elements less than the pivot are moved to its left, and elements greater than the pivot are placed to its right.