Quick Sort is a highly efficient sorting algorithm based on partitioning an array into subarrays. It works by selecting a pivot element and rearranging elements such that all elements less than the pivot come before it, and all greater elements come after. This process is recursively applied to subarrays.
Heap Sort is a comparison-based sorting algorithm that uses a binary heap data structure. It starts by building a max-heap, then repeatedly extracts the maximum element and rebuilds the heap until all elements are sorted.
Shell Sort is an algorithm that sorts an array based on specific intervals and then refines the sorting as these intervals decrease.
Merge Sort is a divide-and-conquer algorithm that splits the array into halves, sorts each half, and then merges the sorted halves back together. It is particularly useful for sorting large datasets.
Radix Sort is a non-comparative sorting algorithm that sorts numbers by processing individual digits. It groups numbers based on their digit values starting from the least significant digit (LSD) or most significant digit (MSD).