Merge Sort Visualized Step By Step
An 8-element array [38, 12, 27, 43, 9, 31, 18, 25] is recursively split into smaller groups down to single numbers, then merged back together in sorted order. Smooth box animations show elements moving and comparing during each merge, with highlights marking correct placements. The final sorted array [9, 12, 18, 25, 27, 31, 38, 43] appears at the end. Useful for computer science students learning divide-and-conquer sorting algorithms without reading code.
16:9 · Preview before teaching · automatic layout checks do not establish subject accuracy
The prompt that made it
Create a clean educational animation showing Merge Sort being performed visually on exactly 8 array elements. Start with an input screen showing: [38] [12] [27] [43] [9] [31] [18] [25] Then visually demonstrate the array being split into smaller groups, down to individual elements. After that, animate the groups being combined back together in sorted order. Show the numbers moving smoothly between groups during the merging process. Highlight the numbers being placed into their correct positions. Make the animation easy to follow without showing any programming code, pseudocode, or technical algorithm text. At the end, display the final sorted array prominently: [9] [12] [18] [25] [27] [31] [38] [43] Use modern educational graphics, clear number boxes, smooth transitions, arrows connecting groups, subtle animations, and a clean background. The video should focus entirely on the visual transformation of the array. Do not display source code or explain the algorithm with paragraphs. Duration: 20–30 seconds. Format: 16:9. Style: professional computer-science educational animation.
Make the next one in this series
- Animate Quick Sort on the same 8-element array using pivot partitioning
- Compare Merge Sort and Bubble Sort speed side by side visually
- Show the recursion tree structure behind Merge Sort's splitting process
