Algorithm Visualization Engine :: Elixir / OTP
ALGOSECHEL
ALGORITHMS :: ELIXIR :: VISUAL
Explore Visualizers ↓
SCROLL
Language
Elixir / OTP
Functional, concurrent, fault-tolerant. Every algorithm expressed in pure Elixir with pattern matching and pipe operators.
Paradigm
Visual First
See the algorithm think. Every step animated, every data structure rendered. No pseudocode, no fruit arrays.
Philosophy
Seeds Over Stats
Meaningful impact over viral metrics. Build understanding that compounds — not content that fades after 48 hours.
01 Visualizers
Greedy Graph O((V+E) log V)
Dijkstra's Algorithm
Shortest path from source to all nodes. Watch the algorithm greedily select the closest unvisited node and relax its neighbors — step by step, in full Elixir.
6 Elixir subtabs · 7 steps · Real-world use cases OPEN →
Recursive Tree O(log n)
Binary Search Tree
Database indexing engine. Insert, search, delete and range query a live BST. In-order traversal always yields sorted keys — the foundation of SQL range scans.
8 Elixir subtabs · Interactive · DB use cases OPEN →
// NEXT
In Progress
Coming Soon
Next visualizer in development. Follow the roadmap below.
— TBA
02 :: Philosophy
Most people learn algorithms with pseudocode and fruit arrays.
ALGOSECHEL teaches them through Elixir —
where the algorithm is the code.
01
Pattern matching is your decision tree. Every branch is explicit, every path is traced.
02
Recursion is your traversal. Tail-call optimization means the stack never lies.
03
The pipe operator is your data flow. Input → transform → output. Always readable.
04
Nothing abstracted away. You see the init, the loop, the relaxation, the reconstruction.
// built with Share Tech Mono · Rajdhani · VT323
// inspired by terminal UIs and functional purity
// seeds over stats — always
Why Elixir

Functional Clarity
at Every Step

Elixir's immutable data and pattern matching make algorithms transparent. When you write def relax(nil, _key), do: nil you're not hiding control flow — you're declaring it. That's the ALGOSECHEL difference.

Pattern Matching
Tail Recursion
Immutable Data
Pipe Operator
OTP / GenServer
Enum / Stream
MapSet / Map
03 Roadmap
algosechel :: build log
✓SHIPPEDDijkstra's Shortest Path — 6 Elixir subtabs, 7-step walkthrough, real-world use cases
✓SHIPPEDBinary Search Tree — DB indexing engine, interactive insert/search/delete/range
✓SHIPPEDDark / Light mode toggle — persists across sessions via localStorage
✓SHIPPEDMobile-responsive layouts — touch targets, scrollable tabs, stacked grids
→IN PROGRESSA* Search — heuristic pathfinding, Manhattan distance, grid visualization
→PLANNEDDynamic Programming — Fibonacci, LCS, Knapsack with memoization table
→PLANNEDGenServer Visualizer — Actor model, mailbox animation, OTP supervision tree
→PLANNEDRed-Black Tree — self-balancing BST, rotation animations, color invariants
→PLANNEDQuicksort / Mergesort — divide and conquer, pivot selection, in-place vs functional
$seeds over stats. building what matters.