Mergesort

This animation shows how mergesort works. First, we devide the array to two parts, then to another
two parts, until we get parts with one element only. These 1-element parts are sorted. Next, we
merge these 1-element parts to a 2-element part. When we have two sorted 2-element parts, we
merge them to a 4-element part. Finally, we merge the two 4-element parts to get the sorted array.

Average rating: –

Please REGISTER or LOG IN, it's totally free! Registered users can
rate animations, add them among their favorites, and mark them as not working.

Source: http://anim.ide.sk/sorting_algorithms_2.php

<div style="padding:1px;background-color:#000;display:inline-block;"><iframe src="https://aa.ide.sk/inalan/en/mergesort.html" scrolling="no" style="overflow:hidden; background:#FFF; border:0px; width:702px; height:632px;"></iframe><div style="background: #000;color:#999;font-size:12px;padding:3px;text-align:right;font-family:Arial,Helvetica,sans-serif">Source: <a href="http://anim.ide.sk/sorting_algorithms_2.php" target="_blank" style="color:#999;text-decoration:none">http://anim.ide.sk/sorting_algorithms_2.php</a></div></div>

Category:Mergesort

Technology:JavaScript animation

Programming language:Pseudocode

Interactivity:Medium

Please REGISTER or LOG IN, it's totally free! Only registered users can write reviews!

Algorithm Animations and Visualizations

Mergesort