Simple comparison-based algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they're in the wrong order.

Finds the minimum element from the unsorted portion and places it at the beginning, reducing the unsorted region in each pass.

Builds the sorted array one element at a time by inserting each element into its correct position in the already-sorted portion.

Divide and conquer algorithm that splits the array into halves, recursively sorts each half, then merges them back in sorted order.

Efficient divide and conquer algorithm that partitions the array around a pivot, placing elements smaller than the pivot to its left.

Uses a binary max heap data structure to sort elements by repeatedly extracting the maximum and placing it in sorted position.

Non-comparison based sorting that processes individual digits from least to most significant, using counting sort as a subroutine.

Distributes elements into a fixed number of buckets based on value range, sorts each bucket individually, then concatenates the results.