$ ls -la ./algorithms

Algorithm Library

Select an algorithm to visualize. Step through each operation.

made with love by Juliana Nieto Cárdenas with Opus 4.5 support ♥

# Sorting

Algorithms for ordering elements

readyO(n log n)

Quicksort

Divide-and-conquer sorting using pivot partitioning.

run →

readyO(n log n)

Merge Sort

Stable divide-and-conquer sorting algorithm.

run →

readyO(n²)

Bubble Sort

Simple comparison-based sorting with adjacent swaps.

run →

readyO(n²)

Insertion Sort

Build sorted array one element at a time by inserting into correct position.

run →

readyO(n²)

Selection Sort

Find minimum element and swap to front, repeat for each position.

run →

# Search

Algorithms for finding elements in data structures

readyO(n)

Linear Search

Simple sequential search checking each element one by one.

run →

readyO(log n)

Binary Search

Efficient search in sorted arrays by halving the search space.

run →

readyO(√n)

Jump Search

Search by jumping blocks of √n, then linear search within block.

run →

# Dynamic Programming

Algorithms using optimal substructure and overlapping subproblems

readyO(n²)

LIS

Find the longest increasing subsequence in an array.

run →

readyO(mn)

Edit Distance

Levenshtein distance - minimum operations to transform one string to another.

run →

# Graph Algorithms

Algorithms for traversing and analyzing graphs

readyO(V + E)

BFS

Breadth-first search for level-order traversal.

run →

readyO(V + E)

DFS

Depth-first search with discovery/finish times.

run →

readyO((V+E)logV)

Dijkstra

Find shortest paths from a source vertex.

run →

readyO(E log V)

Prim's MST

Build minimum spanning tree from any starting vertex.

run →

readyO(E log E)

Kruskal's MST

Build minimum spanning tree using Union-Find data structure.

run →

# String Matching

Algorithms for finding patterns within text

readyO(m)

MPNext

Compute the failure function (prefix function) for Morris-Pratt pattern matching.

run →

readyO(n + m)

MP Search

Morris-Pratt algorithm for finding all occurrences of a pattern in text.

run →

readyO(m)

KMPNext

Compute the optimized failure function for Knuth-Morris-Pratt pattern matching.

run →

readyO(n + m)

KMP Search

Knuth-Morris-Pratt algorithm for finding all occurrences of a pattern in text.

run →

readyO(m)

BM ComputeD

Compute the D array (good suffix shift) for Boyer-Moore preprocessing.

run →

readyO(nm) worst

BM Search

Boyer-Moore search using good suffix shift (D array) with right-to-left comparison.

run →

readyO(n + m)

Rabin-Karp

String matching using rolling hash and modular arithmetic for efficient pattern search.

run →

# tips

→Use arrow keys or h/l to step through the algorithm
→Press space to play/pause auto-stepping
→Try different inputs to understand edge cases