DSA Algorithms

Master Sorting, Searching, and Graph theory with step-by-step animations.

Fundamental

Searching Suite

Linear and Binary Search strategies for efficient data retrieval.

Visualize →
Divide & Conquer

Recursion Tree

Visualize how recursive calls branch out and calculate results.

Visualize →
Graphs

Dijkstra's Path

Find the shortest path in a weighted graph (non-negative weights).

Visualize →
AI / Games

A* Search

Advanced pathfinding using heuristics to find targets faster.

Visualize →
Graphs

Bellman-Ford

Handles negative edge weights and detects negative cycles.

Visualize →
Graphs

Minimum Spanning Tree

Learn how Prim's finds minimum connectivity for networks.

Visualize →
Scheduling

Topological Sort

Order tasks with dependencies using Kahn's Algorithm.

Visualize →
Distribution Sorts

Radix & Bucket Sort

Visualize distribution-based sorting algorithms like Radix and Bucket sort that avoid comparison bottlenecks.

Visualize →
Optimization

Dynamic Programming

Master Memoization and Tabulation by visualizing Fibonacci sequence calculation.

Visualize →
Analysis

Cycle Detection

Find cycles in directed graphs using DFS recursion stack.

Visualize →
Unweighted

BFS Exploration

Visit nodes layer by layer to explore graph structures.

Visualize →
Unweighted

DFS Exploration

Go deep into graph branches using depth-first strategy.

Visualize →
Ordering

Bubble Sort

The 'Hello World' of sorting. Visualize adjacent swaps.

Visualize →
Ordering

Selection Sort

Visualize finding the smallest item per pass.

Visualize →
Ordering

Quick Sort

Visualize pivoting and partitioning logic.

Visualize →
Ordering

Merge Sort

Visualize recursive merging of sorted segments.

Visualize →