Algorithm Visualizer
Choose Category
-- select --
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)
Start
Randomize
Speed: 250ms
Animation Delay (ms)
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 (format: start1,end1;start2,end2;...)
Run Activity Selection
Items (format: weight,value;weight,value;...)
Capacity
Solve Knapsack
Numerator
Denominator
Decompose
Jobs (format: id,deadline,profit;id,deadline,profit;...)
Schedule Jobs
Text for Huffman Coding
Build Huffman Tree
Mode
Decimal → Binary/Octal/Hex
Binary → Octal/Decimal/Hex
Octal → Binary/Decimal/Hex
Hex → 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)
+
Calculate
Base
Binary (Base 2)
Octal (Base 8)
Decimal (Base 10)
Hexadecimal (Base 16)
mod
⚠ Modulo operation requires integer numbers only
Calculate Modulo
Convert/Calculate
Nodes
Edge density (prob %)
Algorithm
Kruskal
Prim
Borůvka
Dijkstra
Dial
Generate Graph
Run Algorithm
Click generate first.
Prime Algorithm
Trial Division
Sieve of Eratosthenes
Fermat Test
Miller-Rabin
AKS (simplified)
Enter a Value
Start
Delay is client-side only
Cipher Algorithm
Caesar Cipher
Rail Fence Cipher
One-Time Pad
Columnar Transposition
Vernam Cipher
Playfair Cipher
Vigenère 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
Inputs
For Chinese Remainder Theorem: Enter pairs like "2,3;3,5;2,7"
Start
Reset
Algo:
-
Steps:
0
Steps will appear here.
Status: idle
Steps will appear here.
Status: idle
Steps will appear here.
Zoom Level:
100%
(Scroll to zoom • Drag to pan • Double-click to reset)
No conversion yet.
Calculation Steps
No calculation steps yet
No graph generated.
Steps will appear here.
Steps will appear here.
No operation performed yet.
Steps will appear here.
Additional details will appear here.
Idle
Results will appear here.