Divide & Conquer / Balanced Splits / Recursive Assembly
These visualizers focus on the moment a problem becomes easier after a split: choose a middle element, break a list into halves, divide a grid into quadrants, or merge multiple sorted streams in rounds.
Trace the Construct Quad Tree algorithm from parsed input through each decision point.
Trace the Convert Sorted Array to Binary Search Tree algorithm from parsed input through each decision point.
Trace the Merge k Sorted Lists algorithm from parsed input through each decision point.
Trace the Sort List algorithm from parsed input through each decision point.