Controls

For Merge/Quick recursion
Step0 / 0
StatusIdle
Comparisons0
Swaps/Moves0
Tip: Click Build Steps after changing the algorithm or array size. Use Step to teach line-by-line.

Sorting Algorithms. BCS 309. Dr. Arash Kermani

Normal Compare Pivot / Focus Fixed / Sorted region Swap/Move i (boundary) j (scan)
📤 Sorted Output ← fills right-to-left as each max is extracted from root

Call Stack 0

🎓 Step Explanation: Click Build Steps, then Step or Play to see line-by-line explanations of what the algorithm is doing and why.