Fara í innihald

Mynd:Merge sort algorithm diagram.svg

Innihald síðu er ekki stutt á öðrum tungumálum.
Úr Wikipediu, frjálsa alfræðiritinu

Upphafleg skrá (SVG-skrá, að nafni til 618 × 595 mynddílar, skráarstærð: 14 KB)

Skrá þessi er af Wikimedia Commons, og deilt meðal annarra verkefna og nýtist því þar. Hér fyrir neðan er afrit af skráarsíðunni þar.

Lýsing

Lýsing
English: 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
Dagsetning 18. september 2007 (original upload date)
Uppruni Transferred from en.wikipedia to Commons by Eric Bauman using CommonsHelper.
Höfundarréttarhafi VineetKumar at enska Wikipedia
SVG genesis
InfoField
 
The SVG code is valid.
 
This diagram was created with unknown tool.

Leyfisupplýsingar:

Public domain This work has been released into the public domain by its author, VineetKumar at enska Wikipedia. This applies worldwide.
In some countries this may not be legally possible; if so:
VineetKumar grants anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law.

Original upload log

The original description page was here. All following user names refer to en.wikipedia.
  • 2007-09-18 22:30 VineetKumar 618×595 (14967 bytes) 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"];

Captions

Add a one-line explanation of what this file represents
A recursive merge sort algorithm used to sort an array of 7 integer values. These are the steps a human would take to emulate merge sort (top-down).

Items portrayed in this file

depicts enska

18. september 2007

media type enska

image/svg+xml

data size enska

14.767 Bæti

595 díll

618 díll

checksum enska

00a71406008751128da38d61684f9bdbdc25bbd0

Breytingaskrá skjals

Smelltu á dagsetningu eða tímasetningu til að sjá hvernig hún leit þá út.

Dagsetning/TímiSmámyndVíddirNotandiAthugasemd
núverandi9. júlí 2018 kl. 14:20Smámynd útgáfunnar frá 9. júlí 2018, kl. 14:20618 × 595 (14 KB)Jochen Burghardtcolorized split (red) and merge (green) arrows; slightly non-white background of lists increases recognizability
7. október 2009 kl. 13:43Smámynd útgáfunnar frá 7. október 2009, kl. 13:43618 × 595 (15 KB)File Upload Bot (Magnus Manske) {{BotMoveToCommons|en.wikipedia|year={{subst:CURRENTYEAR}}|month={{subst:CURRENTMONTHNAME}}|day={{subst:CURRENTDAY}}}} {{Information |Description={{en|Adapted from eleschinski2000's public-domain Merge_sort_algorithm_diagram.jpg. Recreated in dot: dig

Eftirfarandi síða notar þessa skrá:

Altæk notkun skráar

Eftirfarandi wikar nota einnig þessa skrá:

Lýsigögn