Algorithm Visualizer

Benchmark Sort Your Data Algorithm Race Learning

Sorting Algorithms

O(n log n)O(log n)unstableoffline

O(n log n)O(log n)unstableoffline

O(n log n)O(log n)unstableoffline

O(n²)O(1)stableoffline

O(n²)O(1)unstableoffline

O(n²)O(1)stableonline

O(n log n)O(n)stableoffline

O(n log n)O(log n)unstableoffline

O(n log n)O(1)unstableoffline

O(n log² n)O(1)unstableoffline

O(n+k)O(k)stableoffline

O(nk)O(n+k)stableoffline

O(n+k)O(n)stableoffline

O(n log n)O(n)stableoffline

O(n²)O(1)stableoffline

O(n²)O(1)unstableoffline

O(n²)O(1)stableonline

O(n²)O(1)unstableoffline

O(n²)O(1)unstableoffline

O(n²)O(1)stableoffline

Data Structures

Searching

Interpolation Search

Graph Algorithms

Topological Sort

Dynamic Programming

Strings

Geometry

Convex Hull (Graham)

Convex Hull (Jarvis)

Math

Sieve of Eratosthenes

O(log min(a,b))

Fast Exponentiation

Tools

Algorithm Picker

Complexity Calculator

Complexity Quiz

Sorting Network

Donate via PayPal

Inspired by Devin Cook, VisuAlgo & Timo Bingmann

Knuth-Morris-Pratt

Time: O(n+m)Space: O(m)

Builds a failure function to skip redundant comparisons after mismatches.

Text

Pattern

Default

Comparing

Match

Mismatch

Skip

Found

SlowFast

Finish in