Sorting Algorithms

Bubble Sort

Simple comparison sort with O(n²) average case.

Selection Sort

Select minimum element and swap into place.

Insertion Sort

Build sorted array one element at a time.

Merge Sort

Divide-and-conquer stable sort, O(n log n).

Quick Sort

Partition-based sort with average O(n log n).

Heap Sort

Sort using binary heap, O(n log n) in-place.

Counting Sort

Non-comparison sort for bounded integer keys.

Radix Sort

Digit-by-digit sorting for integers and strings.

Shell Sort

Generalized insertion sort with gap sequence.

TimSort

Java's default hybrid merge/insertion sort in Arrays.sort.