Image:Merge sort algorithm diagram.svg

From Wikipedia, the free encyclopedia

• Image
• File history
• File links

[edit] Summary

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

[edit] Licensing

I, the copyright holder of this work, hereby release it into the public domain. This applies worldwide. In case this is not legally possible, I grant any entity the right to use this work for any purpose, without any conditions, unless such conditions are required by law.

File history

Click on a date/time to view the file as it appeared at that time.

• Search for duplicate files
• Edit this file using an external application

  See the setup instructions for more information.

File links