Kamis, 26 Maret 2009

TRACING inserton sort





SIMPLE INSERTION SORTING


void insertion ( int x[ ], int n)

{ int i,k,y

for (k=1;k

{ y=x [k]

for (i=k-1;i>=0 && y

x[i+1] = x [i];

x[i+1] = y ;

}

}




TRACING

N=6

x

k

i

y

kondisi

18

9

8

28

3

2

1

0

9

T /\ T = T




-1


F

9

18

8

28

3

2

2

1

8

T /\ T = T




0


T /\ T = T



-1


F

8

9

18

28

3

2

3

2

28

T /\ F


8

9

18

28

3

2

4

3

3

T /\ T = T




2


T /\ T = T



1


T /\ T = T



0


T /\ T = T



-1


F

3

8

9

18

28

2

5

4

2

T /\ T = T




3


T /\ T = T



2


T /\ T = T



1


T /\ T = T



0


T /\ T = T



-1


F

2

3

8

9

18

28

6