All examples By author By category About

Beaupe

Mergesort II

An improved animation of mergesort. As the name suggests, the algorithm merges sorted arrays, starting with arrays of length 1 and doubling at each step. The two subarrays currently being merged are shown in black.

forked from mbostock's block: Mergesort II