Sorting Algorithms

Simple comparison sort with adjacent element swapping

Find minimum element and swap with front position

Insert elements into sorted portion one by one

Divide and conquer algorithm with guaranteed performance

Partition-based sorting with pivot element

Use binary heap to extract elements in sorted order

Gap-based insertion sort with decreasing intervals

Integer sorting using counting array

Sort integers digit by digit using stable sorting

Distribute elements into buckets and sort individually

Bidirectional bubble sort with both directions

Bubble sort variant with gap-based comparisons

Simple sort similar to insertion sort

Compare odd-even indexed pairs alternately