A simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.
An informed search algorithm that uses heuristics to find the optimal path between start and end nodes efficiently.
Click to add walls • Drag start/end points • Right-click for weights
Breadth-First Search explores graph nodes level by level, visiting all neighbors before moving to the next depth level.
A hierarchical data structure where each node has at most two children, with left child smaller and right child larger than parent.