All Visualizations

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

87 results

Sorting Algorithms

(14)

Bubble Sort

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

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

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

Merge Sort

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

Intermediatedivide & conquerstable

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

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

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

Bubble Sort

Bucket Sort

Cocktail Shaker Sort

Comb Sort

Counting Sort

Heap Sort

Insertion Sort

Merge Sort

Pancake Sort

Quick Sort

Radix Sort (LSD)

Selection Sort

Shell Sort

Tim Sort (Simplified)

Searching Algorithms

Binary Search

Exponential Search

Interpolation Search

Jump Search

Linear Search

Ternary Search

Linked Lists

Doubly Linked List

Floyd's Cycle Detection

Merge Two Sorted Lists

Reverse a Linked List

Stacks & Queues

Balanced Parentheses

Circular Queue (Ring Buffer)

Min-Stack (O(1) minimum)

Queue (FIFO)

Stack (LIFO)

Hashing

Hash Table — Double Hashing

Hash Table — Linear Probing

Hash Table — Quadratic Probing

Hash Table — Separate Chaining

Trees & Heaps

AVL Tree (Self-Balancing BST)

B-Tree

Binary Search Tree

Binary Tree Traversals

Fenwick Tree (Binary Indexed Tree)

Level-Order Traversal (BFS)

Min-Heap (Binary Heap)

Red-Black Tree

Segment Tree (Range Queries)

Trie (Prefix Tree)

Graph Algorithms

A* Pathfinding

Bellman-Ford Shortest Path

Breadth-First Search (BFS)

Depth-First Search (DFS)

Dijkstra's Shortest Path

Floyd-Warshall (All-Pairs)

Kosaraju's Strongly Connected Components

Kruskal's MST

Maximum Flow (Edmonds-Karp)

Prim's MST

Tarjan's Strongly Connected Components

Topological Sort (Kahn's)

Union-Find (Disjoint Set Union)

Dynamic Programming

0/1 Knapsack

Coin Change (Minimum Coins)

Edit Distance (Levenshtein)

Fibonacci — Memoization

Longest Common Subsequence

Longest Increasing Subsequence

Maximum Subarray (Kadane's)

Greedy Algorithms

Activity Selection

Fractional Knapsack

Huffman Coding

Job Sequencing with Deadlines

Backtracking

Combinations (C(n,k) by Backtracking)

N-Queens