2-way
K-way
Replacement Selection
MAIN MEMORY
BUFFER
SECONDARY STORAGE
FILE FOR R
2-way
K-way
Replacement Selection
1x
3x
2.5x
2x
1.75x
1.5x
1.25x
1x
0.75x
0.5x
0.25x
Zoom out to see the algorithm sidebar
OPTIONS
Active Element Focus Scroll to follow the currently active element (e.g. records, pages, ecc...) during animation.
Code Highlight Highlight lines of the algorithm pseudocode.
Fireworks Play fireworks animation when file is sorted.
Frame-Run Associations Show the run currently associated to a frame.
Laser Cursor Show a custom cursor as the mouse pointer.
?

Multipass External Merge Sort
Algorithm Visualizer

2-way Sorting - k-way Sorting - Replacement Selection

Instructions

1
Select the algorithm variation from the tabs (at the top left of the screen).
2
Insert the desired values for the selected algorithm's animation in the input fields
(at the bottom left of the screen).
3
Click on the "play" button in the controls section to play and pause the animation
(at the bottom of the screen).
4
Use the "step forward" and "step backwards" buttons in the controls section
(at the bottom of the screen) to manually play or rewind single steps of the animation.
5
Select the animation playback speed with the "speed" button 1x.
6
Use the restart button to restart the animation with new input values.
7
Additional information and options are available at the bottom left of the screen.
Developed by Valerio Di Stefano - Source code available on GitHub
Project work of the Data Management (2022/2023) course taught by Prof. Maurizio Lenzerini
(master degree course of Engineering in Computer Science at Sapienza University of Rome)

Sorting Tree

Sorting tree of relation R for passes of the [SELECTED ALGORITHM] algorithm.