Professional Documents
Culture Documents
INSERTION-SORT(a)
for i = 2 to n do
K = a[i]
j=i–1
while (j > 0) and (a[j]) > K) do
a[j + 1] = a[j]
j = j –1
end_while
a[j + 1] = K
end_for
Elektrotehnički fakultet, Algoritmi i Strukture Podataka 1
Beograd
Zadatak 1 – Rešenje
i=2
k=10 3 10 4 6 8 9 7 2 1 5
j i
i=3
k=4 3 10 4 6 8 9 7 2 1 5
j i
3 10 10 6 8 9 7 2 1 5
j i
3 4 10 6 8 9 7 2 1 5
j i
i=4 3 4 10 6 8 9 7 2 1 5
k=6
j i
i=5 3 4 6 10 8 9 7 2 1 5
k=8
j i
Elektrotehnički fakultet, Algoritmi i Strukture Podataka 2
Beograd
Zadatak 1 – Rešenje
i=6 3 4 6 8 10 9 7 2 1 5
k=9
j i
i=7 3 4 6 8 9 10 7 2 1 5
k=7
j i
3 4 6 8 9 10 10 2 1 5
j i
3 4 6 8 9 9 10 2 1 5
j i
3 4 6 8 8 9 10 2 1 5
j i
3 4 6 7 8 9 10 2 1 5
j i
Elektrotehnički fakultet, Algoritmi i Strukture Podataka 3
Beograd
Zadatak 1 – Rešenje
i=8
k=2 3 4 6 7 8 9 10 2 1 5
j=0 i
i=9
k=1 2 3 4 6 7 8 9 10 1 5
i
i=10
k=5 1 2 3 4 6 7 8 9 10 5
i
1 2 3 4 5 6 7 8 9 10
h1 = 4 19 61 42 31 7 95 77 25
h2 = 2 7 61 42 25 19 95 77 31
h3 = 1 7 25 19 31 42 61 77 95
7 19 25 31 42 61 77 95
13 10 4 6 8 9 7 2 1 5
i min
1 10 4 6 8 9 7 2 13 5
i min
1 2 4 6 8 9 7 10 13 5
i min
1 2 4 6 8 9 7 10 13 5
i min
64 81 24 42 90 30 9 95
i j
64 81 24 42 90 30 9 95
i j
64 81 24 42 90 30 9 95
i j
64 9 24 42 90 30 81 95
i j
64 9 24 42 90 30 81 95
i j
64 9 24 42 30 90 81 95
i j
64 9 24 42 30 90 81 95
j i
30 9 24 42 64 90 81 95
30 9 24 42 64 90 81 95
i j
30 9 24 42 64 90 81 95
j i
24 9 30 42 64 90 81 95
24 9 30 42 64 90 81 95
i j
24 9 30 42 64 90 81 95
i, j
Elektrotehnički fakultet, Algoritmi i Strukture Podataka 16
Beograd
Zadatak 8 – Rešenje
9 24 30 42 64 90 81 95
i,j
9 24 30 42 64 90 81 95
i j
9 24 30 42 64 90 81 95
j i
9 24 30 42 64 81 90 95
http://www.ida.liu.se/~TDDB28/mtrl/demo/sorting/index.sv.shtml
http://home.earthlink.net/~mihailod/atic/sorting.html
http://www.cs.ubc.ca/~harrison/Java/sorting-demo.html