6. Elementary Sorting

Elementary comparison-based sorts: bubble, selection, insertion, Shell, comb, cycle, and curiosity sorts.

30 items

6. Elementary sorting, 30

index slug name
151 bubble-sort Bubble Sort
152 optimized-bubble-sort Optimized Bubble Sort
153 cocktail-shaker-sort Cocktail Shaker Sort
154 odd-even-sort Odd Even Sort
155 gnome-sort Gnome Sort
156 selection-sort Selection Sort
157 stable-selection-sort Stable Selection Sort
158 double-selection-sort Double Selection Sort
159 insertion-sort Insertion Sort
160 binary-insertion-sort Binary Insertion Sort
161 shell-sort Shell Sort
162 shell-sort-shell-gaps Shell Sort with Shell Gaps
163 shell-sort-hibbard-gaps Shell Sort with Hibbard Gaps
164 shell-sort-sedgewick-gaps Shell Sort with Sedgewick Gaps
165 comb-sort Comb Sort
166 cycle-sort Cycle Sort
167 pancake-sort Pancake Sort
168 stooge-sort Stooge Sort
169 slow-sort Slow Sort
170 bead-sort Bead Sort
171 strand-sort Strand Sort
172 library-sort Library Sort
173 patience-sort Patience Sort
174 tree-sort Tree Sort
175 tournament-sort Tournament Sort
176 smoothsort Smoothsort
177 weak-heap-sort Weak Heap Sort
178 cartesian-tree-sort Cartesian Tree Sort
179 bingo-sort Bingo Sort
180 exchange-sort Exchange Sort
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Bubble Sort

Repeatedly swap adjacent elements that are out of order until the sequence becomes sorted.
algorithms sorting bubble-sort arrays
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Optimized Bubble Sort

Bubble sort with early termination when no swaps occur, reducing unnecessary passes on nearly sorted data.
algorithms sorting bubble-sort optimized
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Cocktail Shaker Sort

A bidirectional variant of bubble sort that alternates passes from left to right and right to left.
algorithms sorting bubble-sort bidirectional
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Odd Even Sort

A variation of bubble sort that alternates between comparing odd-even and even-odd index pairs.
algorithms sorting bubble-sort parallel-friendly
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Gnome Sort

A simple sorting algorithm that moves elements backward when out of order, similar to insertion sort with swaps.
algorithms sorting gnome-sort insertion-like
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Selection Sort

Repeatedly select the minimum element from the unsorted portion and place it at the beginning.
algorithms sorting selection-sort arrays
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Stable Selection Sort

A stable variant of selection sort that preserves the relative order of equal elements by shifting instead of swapping.
algorithms sorting selection-sort stable
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Double Selection Sort

Select both minimum and maximum elements in each pass and place them at the beginning and end.
algorithms sorting selection-sort bidirectional
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Insertion Sort

Build a sorted sequence by inserting each element into its correct position.
algorithms sorting insertion-sort arrays
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Binary Insertion Sort

Insertion sort that uses binary search to find the insertion position, reducing comparisons.
algorithms sorting insertion-sort binary-search
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Shell Sort

Generalization of insertion sort that compares elements at a gap, reducing long-distance inversions early.
algorithms sorting shell-sort gap-based
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Shell Sort with Shell Gaps

Shell sort using the original gap sequence n/2, n/4, ..., 1.
algorithms sorting shell-sort gap-sequence
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Shell Sort with Hibbard Gaps

Shell sort using Hibbard gap sequence 1, 3, 7, 15, ..., improving over simple halving.
algorithms sorting shell-sort gap-sequence
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Shell Sort with Sedgewick Gaps

Shell sort using Sedgewick gap sequence for improved practical performance.
algorithms sorting shell-sort gap-sequence
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Comb Sort

A bubble-sort variant that compares elements at a shrinking gap to remove long-distance inversions early.
algorithms sorting comb-sort gap-based
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Cycle Sort

Minimizes writes by placing each element directly into its correct position using cycles.
algorithms sorting cycle-sort in-place
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Pancake Sort

Sort by repeatedly flipping prefixes to move the maximum element to its correct position.
algorithms sorting pancake-sort prefix-reversal
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Stooge Sort

A recursive sorting algorithm with extremely poor performance based on overlapping subproblems.
algorithms sorting stooge-sort recursive
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Slow Sort

A deliberately inefficient recursive sorting algorithm based on divide and conquer followed by maximum placement.
algorithms sorting slow-sort recursive
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Bead Sort

Sort non-negative integers by simulating gravity on beads arranged in columns.
algorithms sorting bead-sort non-comparison
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Strand Sort

Extract increasing subsequences and merge them to form a sorted sequence.
algorithms sorting strand-sort linked-list
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Library Sort

An insertion-based sorting algorithm that leaves gaps between elements to reduce shifting.
algorithms sorting library-sort insertion-sort
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Patience Sort

Sort by building piles using patience card game rules and then merging them.
algorithms sorting patience-sort lis
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Tree Sort

Insert all elements into a binary search tree, then traverse the tree in sorted order.
algorithms sorting tree-sort binary-search-tree
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Tournament Sort

Sort by repeatedly selecting the minimum element using a tournament tree.
algorithms sorting tournament-sort selection
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Smoothsort

An adaptive in-place comparison sort based on Leonardo heaps.
algorithms sorting smoothsort heap-sort adaptive
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Weak Heap Sort

A variant of heapsort using weak heaps with fewer comparisons.
algorithms sorting weak-heap heap-sort
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Cartesian Tree Sort

Sort by building a Cartesian tree and extracting elements via inorder traversal.
algorithms sorting cartesian-tree tree-sort
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Bingo Sort

Repeatedly place all occurrences of the current minimum value before moving to the next distinct value.
algorithms sorting bingo-sort duplicate-friendly
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Exchange Sort

A simple quadratic sorting algorithm that compares all pairs and swaps out-of-order elements.
algorithms sorting exchange-sort quadratic