∑
ALGORITHMS_TODAY.COM
∑ ALGORITHM NEURAL INTERFACE v2.0 ∑

ENTER THE MATRIX

DECODE THE ALGORITHM

The system is all around you. Step through every algorithm one instruction at a time. Watch the truth reveal itself. There is no spoon.

06
MODULES
04
CATEGORIES
∞
ITERATIONS
FILTER:
[SORTING]

BUBBLE_SORT

Repeatedly compares adjacent elements and swaps them into order. The simplest — and slowest — sorting truth.
TIME
O(n²)
SPACE
O(1)
LEVEL
BAS
[SORTING]

MERGE_SORT

Divide and conquer. Split, sort recursively, merge. Guarantees optimal time at memory cost.
TIME
O(n log n)
SPACE
O(n)
LEVEL
INT
[SORTING]

QUICK_SORT

Pick a pivot. Partition. Recurse. Fast in practice. Dangerous with bad pivots.
TIME
O(n log n)
SPACE
O(log n)
LEVEL
INT
[SEARCHING]

BINARY_SEARCH

Divide the sorted array in half each time. Logarithmic efficiency hiding in plain sight.
TIME
O(log n)
SPACE
O(1)
LEVEL
BAS
[GRAPH]

BREADTH_FIRST

Explore all nodes at present depth before moving deeper. Guaranteed shortest path in unweighted graphs.
TIME
O(V+E)
SPACE
O(V)
LEVEL
INT
[PATHFINDING]

A_STAR_SEARCH

Heuristic-guided pathfinding. Smarter than Dijkstra. The algorithm that maps your world.
TIME
O(E log V)
SPACE
O(V)
LEVEL
ADV