Sorting Algorithms

A simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.

An in-place comparison sorting algorithm that repeatedly selects the minimum element and moves it to the sorted part.

A simple sorting algorithm that builds the final sorted array one item at a time, inserting each new item into its proper place.

An efficient, stable, comparison-based sorting algorithm using the divide and conquer paradigm.

An efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order using a pivot.

A comparison-based sorting technique based on a Binary Heap data structure. It is similar to selection sort.

A highly efficient, in-place comparison sort. It is an generalization of insertion sort, allowing the exchange of items that are far apart.

A non-comparison sorting algorithm that operates by counting the number of objects that have each distinct key value.

A non-comparative sorting algorithm that sorts integers by processing individual digits.

A distribution-based sorting algorithm that divides elements into buckets, sorts each bucket individually, and then concatenates them.

An improved version of bubble sort that eliminates small values at the end of the list (turtles) by using a gap larger than 1.

A simple sorting algorithm similar to insertion sort that works by moving elements backward until they are in the correct position.

A bidirectional variation of bubble sort that traverses the list in both directions alternately, improving performance on certain types of data.

A hybrid stable sorting algorithm derived from merge sort and insertion sort, designed to perform well on real-world data. It is the default sorting algorithm in Python and Java.