Image: Merge sort algorithm diagram

Size of this PNG preview of this SVG file: 618 × 595 pixels. Other resolution: 249 × 240 pixels.

Original image ‎(SVG file, nominally 618 × 595 pixels, file size: 14 KB)

Description: Adapted from eleschinski2000's public-domain Merge sort algorithm diagram.jpg. Recreated in dot: digraph G { node[shape=record]; s00 [label="38|27|43|3|9|82|10"]; s00 -> s10; s10 [label="38|27|43|3"]; s00 -> s11; s11 [label="9|82|10"]; s10 -> s20; s20 [label="38|27"]; s10 -> s21; s21 [label="43|3"]; s11 -> s22; s22 [label="9|82"]; s20 -> s30; s30 [label="38"]; s20 -> s31; s31 [label="27"]; s21 -> s32; s32 [label="43"]; s21 -> s33; s33 [label="3"]; s22 -> s34; s34 [label="9"]; s22 -> s35; s35 [label="82"]; s11 -> s23; s23 [label="10"]; s23 -> s36; s36 [label="10"]; s30 -> s40; s31 -> s40; s40 [label="27|38"]; s32 -> s41; s33 -> s41; s41 [label="3|43"]; s34 -> s42; s35 -> s42; s42[label="9|82"]; s36 -> s43; s43[label="10"]; s40 -> s50; s41 -> s50; s50[label="3|27|38|43"]; s42 -> s51; s43 -> s51; s51[label="9|10|82"]; s50 -> s60; s51 -> s60; s60[label="3|9|10|27|38|43|82"]; } and output to svg via: dot -Tsvg msad.dot
Title: Merge sort algorithm diagram
Credit: Transferred from en.wikipedia to Commons by Eric Bauman using CommonsHelper.
Author: VineetKumar at English Wikipedia
Usage Terms: Public domain
License: Public domain
Attribution Required?: No

Image usage

The following page links to this image:

Divide-and-conquer algorithm

All content from Kiddle encyclopedia articles (including the article images and facts) can be freely used under Attribution-ShareAlike license, unless stated otherwise.