Algomination
Data Structures
AboutContact

Algomination

Learn algorithms and data structures through smooth, interactive visualizations.

SortingSearchingArray AlgorithmsData StructuresAboutContact

© 2026Algomination. Created by Omang Rawat & Rahul Soni.

Omang Rawat
Rahul Soni

Algomination

~ Algorithms with Animation

Learn algorithms and data structures through smooth, interactive visualizations — at your own pace.

Start with Sorting How it works

Sorting

Bubble, Selection & Insertion — watch arrays rearrange step by step.

Searching

Linear & Binary search — follow the pointers as they close in on a target.

Array Algorithms

Two pointers, sliding windows & monotonic stacks — the patterns behind the classics.

Data Structures

Interactive Stack — push, pop and peek with live animations.

Built for understanding

Not just pretty motion — a visualization engine designed to make each step legible.

Step, scrub & replay

Every algorithm runs as discrete frames. Play it, pause it, or scrub the timeline to any moment.

Smooth animations

Elements physically move and settle with spring physics — not abrupt redraws.

Learn by doing

Use your own input, read the running commentary, and build real intuition.

What is Algomination?

Algomination is a free, interactive learning platform that turns abstract computer-science concepts into something you can watch. Instead of tracing pseudocode by hand, you give an algorithm your own input and see exactly how it works — every comparison, swap, and pointer move animated, step by step.

Who it's for

It's built for students preparing for exams or coding interviews, self-taught developers filling in the fundamentals, and educators who want a clear visual aid. No setup, no account required — just open a visualizer and start experimenting.

How it works

Each algorithm runs entirely in your browser and emits a sequence of frames. A player then animates those frames with smooth spring physics, so you can play, pause, scrub the timeline, or step through one operation at a time at your own pace. A running commentary explains what's happening on every frame, and a complexity summary shows the time and space cost.

What you can explore

Today you can visualize six sorting algorithms (Bubble, Selection, Insertion, Merge, Quick, and Heap sort), two search algorithms (Linear and Binary search), a growing set of essential array algorithms (Kadane's maximum subarray, two-pointer pair sum, sliding window, Dutch National Flag, trapping rain water, and next greater element), and a dozen data structures — from stacks and queues to binary search trees, heaps, tries, and union-find. New visualizers are added over time, and the project is open to community contributions.

Explore sorting Read more about the project

Made something cool?

Algomination is a community project. Built your own animated algorithm? Share it and get credited.

Submit a project