Visualize & Master
Algorithms Step-by-Step.
Interactive animations, real-time code highlighting, and speed controls for every data structure.
Bubble Sort
Repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order.
Selection Sort
Divides the list into a sorted and unsorted region, repeatedly selecting the smallest element from the unsorted region.
Insertion Sort
Builds the final sorted array one item at a time by inserting each element into its proper position among sorted items.
Quick Sort
Picks an element as a pivot and partitions the given array around the picked pivot using divide and conquer.
Merge Sort
Divides array into halves, recursively sorts them, and then merges the two sorted halves back together.
Binary Search
Search algorithm that finds the position of a target value within a sorted array by dividing search space in half.
Dijkstra's Algorithm
Finds the shortest paths between nodes in a weighted graph with non-negative edge weights.
BFS Traversal (Breadth-First)
Level-by-level graph traversal algorithm using a Queue (FIFO) to explore neighboring nodes in expanding ripples.
DFS Traversal (Depth-First)
Deep branch graph traversal algorithm using a Stack (LIFO / Recursion) to explore down each path before backtracking.