ALGO FORGE
Tool #2020 · Algorithm Playground · Sort · Pathfind · Structures · Complexity
SORTING LAB
PATHFINDING
DATA STRUCTURES
COMPLEXITY
CODE VIEW
Algorithm:
Bubble Sort
Selection Sort
Insertion Sort
Merge Sort
Quick Sort
Heap Sort
Radix Sort
Shell Sort
Size:
Speed:
Generate
Start
Pause
Step
Reset
Custom array (comma-sep):
Use Custom
Comparisons:
0
Swaps:
0
Time:
0ms
Race Mode
Algo A:
Bubble
Selection
Insertion
Merge
Quick
Heap
Radix
Shell
Algo B:
Bubble
Selection
Insertion
Merge
Quick
Heap
Radix
Shell
Race!
Reset Race
A: --
B: --
Algo A
Algo B
Algorithm:
BFS
DFS
Dijkstra
A* (Manhattan)
Grid:
x
Resize
Speed:
Mode:
Wall
Start
End
Run
Clear Path
Clear Walls
Clear All
Maze:
Random 30%
Recursive Division
Serpentine
Generate Maze
Visited:
0
Path:
0
Time:
0ms
BST
Heap
Stack
Queue
Linked List
Hash Table
Insert
Delete
Search
Inorder
Preorder
Postorder
Clear
Min Heap
Max Heap
Insert
Extract
Clear
Array Representation
Push
Pop
Peek
Clear
Enqueue
Dequeue
Peek
Clear
Ins Head
Ins Tail
Ins @Idx
Delete Val
Search
Reverse
Clear
Insert
Lookup
Delete
Clear
Buckets:
Big-O Comparison Chart
Complexity Classes
Algorithm Complexity Table
Operations Calculator
Complexity:
O(1)
O(log n)
O(n)
O(n log n)
O(n^2)
O(n^3)
O(2^n)
n =
Calculate
Algorithm / Structure:
Bubble Sort
Selection Sort
Insertion Sort
Merge Sort
Quick Sort
Heap Sort
Radix Sort
Shell Sort
BFS
DFS
Dijkstra
A* Search
Binary Search Tree
Heap (Min/Max)
Stack
Queue
Linked List
Hash Table