Sorting

Algorithms that arrange elements in a specific order — fundamental to computer science

Sort an array by repeatedly swapping adjacent elements that are in the wrong order

Sort an array by repeatedly finding the minimum element and placing it at the beginning

Build a sorted portion by inserting each element into its correct position one at a time

Sort an array using bottom-up merge operations without recursion

Sort an array by building a max heap and repeatedly placing the largest element at the end

Sort an array using divide-and-conquer by partitioning around a pivot element