All Visualizations

Every algorithm and data structure in one place. Search by name or tag, filter by difficulty, and star your favorites.

324 results

Sorting Algorithms

(32)

American Flag Sort

Performs in-place MSD radix distribution with cycle leaders, then recurses into digit buckets.

Advancedsortingstep-by-step

Bead Sort

Represents nonnegative integers as bead rows and applies gravity column by column.

Intermediatesortingstep-by-step

Binary Insertion Sort

Uses binary search to locate each insertion point, then shifts the sorted prefix.

Intermediatesortingstep-by-step

Bitonic Sort

Builds bitonic sequences and merges them through a fixed parallel compare-exchange network.

Advancedsorting networkparallel

Block Sort

Sorts small blocks, then merges adjacent sorted blocks at doubling widths.

Intermediatesortingstep-by-step

Bubble Sort

Repeatedly swaps adjacent out-of-order elements, bubbling the largest to the end each pass.

Beginnercomparison sortstable

Bucket Sort

Scatters values into range-based buckets, sorts each bucket internally, then concatenates — fast when input is uniformly distributed.

Intermediatenon-comparisondistribution sort

Cocktail Shaker Sort

A bidirectional bubble sort that alternates forward and backward passes, sorting from both ends inward.

Beginnerbidirectionalstable

Comb Sort

Improves bubble sort by comparing elements a shrinking gap apart, eliminating small trailing values fast.

Beginnergap sequencebubble variant

Counting Sort

Counts occurrences of each key and uses prefix sums to place elements directly — O(n + k), no comparisons.

Intermediatenon-comparisonstable

Cycle Sort

Places values by final rank and rotates permutation cycles, minimizing array writes.

Advancedcycleminimum writes

Gnome Sort

Walks forward through ordered neighbors and backward after swapping an inversion.

Beginneradjacent swapsstable

Heap Sort

Builds a max-heap in the array, then repeatedly swaps the root maximum to the end and re-heapifies.

Intermediateheapin-place

Insertion Sort

Builds a sorted prefix one element at a time, shifting larger elements right to open a slot for each key.

Beginnercomparison sortstable

Introsort

Uses quicksort until depth becomes risky, then falls back to heap sort and handles small ranges by insertion sort.

Advancedhybridquicksort

Library Sort

Maintains sorted items on a gapped shelf and periodically redistributes them to restore insertion space.

Advancedsortingstep-by-step

Merge Sort

Recursively splits the array in half, sorts each half, then merges them — guaranteed O(n log n).

Intermediatedivide & conquerstable

Odd–Even Sort

Alternates odd-indexed and even-indexed adjacent compare-exchange phases.

Intermediateparalleltransposition

Pancake Sort

Sorts using only 'flip the first k elements' operations — find the max, flip it to the front, then flip it to its final position.

Intermediatecomparison sortflip-based

Patience Sort

Builds patience piles and repeatedly extracts the minimum visible pile top.

Advancedsortingstep-by-step

Pigeonhole Sort

Counts every integer in a direct range-indexed pigeonhole and reads the holes in order.

Beginnersortingstep-by-step

Quick Sort

Partitions around a pivot so smaller elements go left and larger go right, then recurses on each side.

Intermediatedivide & conquerin-place

Radix Sort (LSD)

Sorts integers digit by digit from least to most significant, using a stable bucket pass for each digit.

Intermediatenon-comparisonstable

Selection Sort

Repeatedly selects the smallest remaining element and moves it to the front, using at most n−1 swaps.

Beginnercomparison sortin-place

Shell Sort

Generalizes insertion sort by comparing elements a shrinking gap apart, moving them long distances early.

Intermediategap sequencein-place

Smoothsort

Builds a forest of Leonardo max-heaps and dismantles it from the maximum end.

Advancedsortingstep-by-step

Spreadsort

Recursively distributes integers by their numeric spread and insertion-sorts small buckets.

Advancedsortingstep-by-step

Stooge Sort

Recursively sorts the first two-thirds, last two-thirds, then first two-thirds again.

Advancedsortingstep-by-step

Strand Sort

Extracts increasing strands from the input and merges them into a sorted output.

Intermediatesortingstep-by-step

Tim Sort (Simplified)

The hybrid behind Python's and Java's default sort: insertion-sort small runs, then merge them like merge sort — stable and fast on partially-sorted data.

All Visualizations

Sorting Algorithms

American Flag Sort

Bead Sort

Binary Insertion Sort

Bitonic Sort

Block Sort

Bubble Sort

Bucket Sort

Cocktail Shaker Sort

Comb Sort

Counting Sort

Cycle Sort

Gnome Sort

Heap Sort

Insertion Sort

Introsort

Library Sort

Merge Sort

Odd–Even Sort

Pancake Sort

Patience Sort

Pigeonhole Sort

Quick Sort

Radix Sort (LSD)

Selection Sort

Shell Sort

Smoothsort

Spreadsort

Stooge Sort

Strand Sort

Tim Sort (Simplified)

Tournament Sort

Tree Sort

Searching Algorithms

Binary Search

Binary Search: First & Last

Exponential Search

Fibonacci Search

Interpolation Search

Jump Search

K-Nearest Neighbors

Linear Search

Lower and Upper Bound

Mo's Algorithm

Peak Finding

Quickselect

Rotated Array Search

Sentinel Search

Sorted Matrix Search

Ternary Search

Linked Lists

Circular Linked List

Doubly Linked List

Floyd's Cycle Detection

Merge Two Sorted Lists

Reverse a Linked List

Singly Linked List Operations

Stacks & Queues

Balanced Parentheses

Circular Queue (Ring Buffer)

Deque Operations

Min-Stack (O(1) minimum)

Monotonic Stack

Priority Queue

Queue (FIFO)

Queue Using Two Stacks

Stack (LIFO)

Hashing

Bloom Filter

Cuckoo Hashing

Hash Table — Double Hashing

Hash Table — Linear Probing

Hash Table — Quadratic Probing

Hash Table — Separate Chaining

LFU Cache

LRU Cache

Robin Hood Hashing

Trees & Heaps

2-3 Tree