Sorting | Athro

📄️ Bubble Sort

Repeatedly steps through the array, compares adjacent elements, and swaps them if they are in the wrong order.

Builds the sorted array one element at a time by inserting each item into its correct position.

Repeatedly finds the minimum element from the unsorted portion and places it at the beginning.

A divide-and-conquer algorithm that splits the array in half, sorts each half, and merges them back together.

Selects a pivot element, partitions the array around it, and recursively sorts the subarrays.

Builds a max heap from the array, then repeatedly extracts the maximum element to the end.

A non-comparison sort that counts occurrences of each value and reconstructs the array in order.

Sorts integers digit by digit using a stable sub-sort at each place value.