Algorithm Visualizer
Choose category
Select a category
Sorting
Searching
String Searching
Greedy Algorithms
Graph Algorithms
Number Converters
Prime
Cryptography
More
Sorting algorithm
Insertion
Selection
Bubble
Merge
Quick
Heap
Counting
Radix
Bucket
Shell
Comb
Tim
Tree
Tournament
Array (comma separated)
Animation speed
250 ms
Start
Randomize
Search algorithm
Linear
Binary
Jump
Exponential
Interpolation
Ternary
Fibonacci
Array (comma separated)
Target
Start
Reset
String algorithm
Naive
KMP
Rabin-Karp
Boyer-Moore (Bad Character)
Text
Pattern
Start
Reset
Greedy algorithm
Activity Selection
0/1 Knapsack
Egyptian Fraction
Job Sequencing
Huffman Coding
Activities (start,end;start,end;...)
Run Activity Selection
Items (weight,value;weight,value;...)
Capacity
Solve Knapsack
Numerator
Denominator
Decompose
Jobs (id,deadline,profit;...)
Schedule Jobs
Text for Huffman coding
Build Huffman Tree
Mode
Decimal to Binary / Octal / Hex
Binary to Octal / Decimal / Hex
Octal to Binary / Decimal / Hex
Hex to Binary / Octal / Decimal
Arithmetic Operation
Modulo Operation
Enter value
Operation
Addition
Subtraction
Multiplication
Division
Base
Binary (Base 2)
Octal (Base 8)
Decimal (Base 10)
Hexadecimal (Base 16)
Operands
+
Floating point values are supported.
Base
Binary (Base 2)
Octal (Base 8)
Decimal (Base 10)
Hexadecimal (Base 16)
Operands
mod
Modulo accepts whole numbers only.
Convert
Number of nodes
6
-
+
Node values
Type a new number in any chip, or double-click a node on the canvas.
Edge density
60%
Algorithm
Kruskal
Prim
Boruvka
Dijkstra
Dial
Animation speed
600 ms
Run Algorithm
New Graph
Generate a graph to begin.
Prime algorithm
Trial Division
Sieve of Eratosthenes
Fermat Test
Miller-Rabin
AKS (simplified)
Enter a value
Start
Cipher algorithm
Caesar Cipher
Rail Fence Cipher
One-Time Pad
Columnar Transposition
Vernam Cipher
Playfair Cipher
Vigenere Cipher
Affine Cipher
Scytale Cipher
Hill Cipher
Substitution Cipher
Transposition Cipher
SHA-256 Hash
Monoalphabetic Cipher
Polyalphabetic Cipher
Product Cipher
RSA Algorithm
Diffie-Hellman Key Exchange
Input text
Key
Encrypt
Decrypt
Analyze
More algorithms
GCD & LCM (Euclidean)
LCM Calculation
Extended Euclidean
Chinese Remainder Theorem
First input
Second input
Chinese Remainder Theorem: enter pairs such as 2,3;3,5;2,7
Start
Reset
Sorting
Algorithm
-
Steps
0
Steps will appear here.
Searching
Status: idle
Steps will appear here.
String Searching
Status: idle
Steps will appear here.
Greedy Algorithms
No result yet.
Steps will appear here.
No result yet.
Steps will appear here.
No result yet.
Steps will appear here.
No result yet.
Steps will appear here.
Zoom
100%
Scroll to zoom, drag to pan, double-click to reset
No result yet.
Number Converters
No conversion yet.
Calculation steps
No calculation steps yet.
Graph Algorithms
Nodes
0
Edges
0
Drag a node to move it. Double-click a node to change its number, or double-click an edge weight to change it.
No graph generated.
Steps will appear here.
Prime
Steps will appear here.
Cryptography
No operation performed yet.
Steps will appear here.
Additional details will appear here.
More Algorithms
Idle
Results will appear here.