Neural Ninjas Β· DSA Simulation Labs Β· Lab 22

🌳 The Permutation Tree

Every swap opens a new branch. The tree draws itself one edge at a time as the algorithm fixes a position, recurses into the rest β€” then swaps back and tries the next branch.

Branch Log

Controls

🌳 TreeI only exist because the algorithm actually visited each branch β€” nothing here is drawn in advance.
πŸ”€ SwapI fix one element into position by trading places with it. Undo me, and the array goes right back to how it was before this branch.
Pick a level above to begin.