Algorithm Visualizations

Learn algorithms through interactive visualizations and step-by-step execution

Sorting Algorithms

Divide and conquer algorithm with O(n log n) average time complexity

Stable divide and conquer algorithm with O(n log n) time complexity

Simple comparison-based algorithm with O(n²) time complexity

Comparison-based sorting algorithm using binary heaps with O(n log n) time complexity

Traverses graph level by level, useful for finding shortest paths in unweighted graphs

Explores as far as possible along branches before backtracking

Finds shortest paths from a source node to all other nodes in a weighted graph

Classic optimization problem that maximizes value with weight constraints

Finds the longest subsequence common to two sequences

Efficient search algorithm that finds an item in a sorted array in O(log n) time

Simple search algorithm that checks every element in a sequence