Сортировка массива. Метод пузырька. презентация

Сентябрь 21, 2022

Главная
Информатика
Сортировка массива. Метод пузырька.

Содержание

2. Алгоритм for i := 1 to m - 1 do for j := 1 to m
3. k i=1 1 9 2 4 8 3 5 4 10 6 j :=1 to 9
4. k i=1 1 9 2 4 8 3 5 4 10 6 j :=1 to 9
5. k i=1 1 2 9 4 8 3 5 4 10 6 j :=1 to 9
6. k i=1 1 2 4 9 8 3 5 4 10 6 j :=1 to 9
7. k i=1 1 2 4 8 9 3 5 4 10 6 j :=1 to 9
8. k i=1 1 2 4 8 3 9 5 4 10 6 j :=1 to 9
9. k i=1 1 2 4 8 3 5 9 4 10 6 j :=1 to 9
10. k i=1 1 2 4 8 3 5 4 9 10 6 j :=1 to 9
11. k i=1 1 2 4 8 3 5 4 6 10 9 j :=1 to 9
12. k i=2 1 2 4 8 3 5 4 6 10 9 j :=1 to 8
13. k i=2 1 2 4 8 3 5 4 6 10 9 j :=1 to 8
14. k i=2 1 2 4 8 3 5 4 6 10 9 j :=1 to 8
15. k i=2 1 2 4 8 3 5 4 6 10 9 j :=1 to 8
16. k i=2 1 2 4 3 8 5 4 6 10 9 j :=1 to 8
17. k i=2 1 2 4 3 5 8 4 6 10 9 j :=1 to 8
18. k i=2 1 2 4 3 5 4 8 6 10 9 j :=1 to 8
19. k i=2 1 2 4 3 5 4 6 8 10 9 j :=1 to 8
20. k i=3 1 2 4 3 5 4 6 8 10 9 j :=1 to 7
21. k i=3 1 2 4 3 5 4 6 8 10 9 j :=1 to 7
22. k i=3 1 2 4 3 5 4 6 8 10 9 j :=1 to 7
23. k i=3 1 2 3 4 5 4 6 8 10 9 j :=1 to 7
24. k i=3 1 2 3 4 5 4 6 8 10 9 j :=1 to 7
25. k i=3 1 2 3 4 4 5 6 8 10 9 j :=1 to 7
26. k i=3 1 2 3 4 4 5 6 8 10 9 j :=1 to 7
27. k i=4 1 2 3 4 4 5 6 8 10 9 j :=1 to 6
28. k i=4 1 2 3 4 4 5 6 8 10 9 j :=1 to 6
29. k i=4 1 2 3 4 4 5 6 8 10 9 j :=1 to 6
30. k i=4 1 2 3 4 4 5 6 8 10 9 j :=1 to 6
31. k i=4 1 2 3 4 4 5 6 8 10 9 j :=1 to 6
32. k i=4 1 2 3 4 4 5 6 8 10 9 j :=1 to 6
33. k i=5 1 2 3 4 4 5 6 8 10 9 j :=1 to 5
34. k i=5 1 2 3 4 4 5 6 8 10 9 j :=1 to 5
36. Скачать презентацию

Слайд 2

Алгоритм
for i := 1 to m - 1 do
for j

:= 1 to m - i do
if A[ j ] > A[ j + 1] then begin
k := A[ j ];
A[ j ] := A[ j + 1];
A[ j + 1] := k;
end;

Слайд 3

k
i=1
1
9
2
4
8
3
5
4
10
6
j :=1 to 9
j :=
1
if A[1] > A[ 2] then begin

k := A[ 1 ];
A[ 1 ] := A[ 2 ];
A[ 2 ] := k;

Слайд 4

k
i=1
1
9
2
4
8
3
5
4
10
6
j :=1 to 9
j :=
2
if A[ 2 ] > A[ 3

] then begin
k := A[ 2 ];
A[ 2 ] := A[ 3 ];
A[ 3 ] := k;

Слайд 5

k
i=1
1
2
9
4
8
3
5
4
10
6
j :=1 to 9
j :=
3
if A[ 3 ] > A[ 4

] then begin
k := A[ 3 ];
A[ 3 ] := A[ 4 ];
A[ 4 ] := k;

Слайд 6

k
i=1
1
2
4
9
8
3
5
4
10
6
j :=1 to 9
j :=
4
if A[ 4 ] > A[ 5

] then begin
k := A[ 4 ];
A[ 4 ] := A[ 5 ];
A[ 5 ] := k;

Слайд 7

k
i=1
1
2
4
8
9
3
5
4
10
6
j :=1 to 9
j :=
5
if A[ 5 ] > A[ 6

] then begin
k := A[ 5 ];
A[ 5 ] := A[ 6 ];
A[ 6 ] := k;

Слайд 8

k
i=1
1
2
4
8
3
9
5
4
10
6
j :=1 to 9
j :=
6
if A[ 6 ] > A[ 7

] then begin
k := A[ 6 ];
A[ 6 ] := A[ 7 ];
A[ 7 ] := k;

Слайд 9

k
i=1
1
2
4
8
3
5
9
4
10
6
j :=1 to 9
j :=
7
if A[ 7 ] > A[ 8

] then begin
k := A[ 7 ];
A[ 7 ] := A[ 8 ];
A[ 8 ] := k;

Слайд 10

k
i=1
1
2
4
8
3
5
4
9
10
6
j :=1 to 9
j :=
8
if A[ 8 ] > A[ 9

] then begin
k := A[ 8 ];
A[ 8 ] := A[ 9 ];
A[ 9 ] := k;

Слайд 11

k
i=1
1
2
4
8
3
5
4
6
10
9
j :=1 to 9
j :=
9
if A[ 9 ] > A[ 10

] then begin
k := A[ 9 ];
A[ 9 ] := A[ 10 ];
A[ 10 ] := k;

Слайд 12

k
i=2
1
2
4
8
3
5
4
6
10
9
j :=1 to 8
j :=
1
if A[ 1 ] > A[ 2

] then begin
k := A[ 1 ];
A[ 1 ] := A[ 2 ];
A[ 2 ] := k;

Слайд 13

k
i=2
1
2
4
8
3
5
4
6
10
9
j :=1 to 8
j :=
2
if A[ 2 ] > A[ 3

] then begin
k := A[ 2 ];
A[ 2 ] := A[ 3 ];
A[ 3 ] := k;

Слайд 14

k
i=2
1
2
4
8
3
5
4
6
10
9
j :=1 to 8
j :=
3
if A[ 3 ] > A[ 4

] then begin
k := A[ 3 ];
A[ 3 ] := A[ 4 ];
A[ 4 ] := k;

Слайд 15

k
i=2
1
2
4
8
3
5
4
6
10
9
j :=1 to 8
j :=
4
if A[ 4 ] > A[ 5

] then begin
k := A[ 4 ];
A[ 4 ] := A[ 5 ];
A[ 5 ] := k;

Слайд 16

k
i=2
1
2
4
3
8
5
4
6
10
9
j :=1 to 8
j :=
5
if A[ 5 ] > A[ 6

] then begin
k := A[ 5 ];
A[ 5 ] := A[ 6 ];
A[ 6 ] := k;

Слайд 17

k
i=2
1
2
4
3
5
8
4
6
10
9
j :=1 to 8
j :=
6
if A[ 6 ] > A[ 7

] then begin
k := A[ 6 ];
A[ 6 ] := A[ 7 ];
A[ 7 ] := k;

Слайд 18

k
i=2
1
2
4
3
5
4
8
6
10
9
j :=1 to 8
j :=
7
if A[ 7 ] > A[ 8

] then begin
k := A[ 7 ];
A[ 7 ] := A[ 8 ];
A[ 8 ] := k;

Слайд 19

k
i=2
1
2
4
3
5
4
6
8
10
9
j :=1 to 8
j :=
8
if A[ 8 ] > A[ 9

] then begin
k := A[ 8 ];
A[ 8 ] := A[ 9 ];
A[ 9 ] := k;

Слайд 20

k
i=3
1
2
4
3
5
4
6
8
10
9
j :=1 to 7
j :=
1
if A[ 1 ] > A[ 2

] then begin
k := A[ 1 ];
A[ 1 ] := A[ 2 ];
A[ 2 ] := k;

Слайд 21

k
i=3
1
2
4
3
5
4
6
8
10
9
j :=1 to 7
j :=
2
if A[ 2 ] > A[ 3

] then begin
k := A[ 2 ];
A[ 2 ] := A[ 3 ];
A[ 3 ] := k;

Слайд 22

k
i=3
1
2
4
3
5
4
6
8
10
9
j :=1 to 7
j :=
3
if A[ 3 ] > A[ 4

] then begin
k := A[ 3 ];
A[ 3 ] := A[ 4 ];
A[ 4 ] := k;

Слайд 23

k
i=3
1
2
3
4
5
4
6
8
10
9
j :=1 to 7
j :=
4
if A[ 4 ] > A[ 5

] then begin
k := A[ 4 ];
A[ 4 ] := A[ 5 ];
A[ 5 ] := k;

Слайд 24

k
i=3
1
2
3
4
5
4
6
8
10
9
j :=1 to 7
j :=
5
if A[ 5 ] > A[ 6

] then begin
k := A[ 5 ];
A[ 5 ] := A[ 6 ];
A[ 6 ] := k;

Слайд 25

k
i=3
1
2
3
4
4
5
6
8
10
9
j :=1 to 7
j :=
6
if A[ 6 ] > A[ 7

] then begin
k := A[ 6 ];
A[ 6 ] := A[ 7 ];
A[ 7 ] := k;

Слайд 26

k
i=3
1
2
3
4
4
5
6
8
10
9
j :=1 to 7
j :=
7
if A[ 7 ] > A[ 8

] then begin
k := A[ 7 ];
A[ 7 ] := A[ 8 ];
A[ 8 ] := k;

Слайд 27

k
i=4
1
2
3
4
4
5
6
8
10
9
j :=1 to 6
j :=
1
if A[ 1 ] > A[ 2

] then begin
k := A[ 1 ];
A[ 1 ] := A[ 2 ];
A[ 2 ] := k;

Слайд 28

k
i=4
1
2
3
4
4
5
6
8
10
9
j :=1 to 6
j :=
2
if A[ 2 ] > A[ 3

] then begin
k := A[ 2 ];
A[ 2 ] := A[ 3 ];
A[ 3 ] := k;

Слайд 29

k
i=4
1
2
3
4
4
5
6
8
10
9
j :=1 to 6
j :=
3
if A[ 3 ] > A[ 4

] then begin
k := A[ 3 ];
A[ 3 ] := A[ 4 ];
A[ 4 ] := k;

Слайд 30

k
i=4
1
2
3
4
4
5
6
8
10
9
j :=1 to 6
j :=
4
if A[ 4 ] > A[ 5

] then begin
k := A[ 4 ];
A[ 4 ] := A[ 5 ];
A[ 5 ] := k;

Слайд 31

k
i=4
1
2
3
4
4
5
6
8
10
9
j :=1 to 6
j :=
5
if A[ 5 ] > A[ 6

] then begin
k := A[ 5 ];
A[ 5 ] := A[ 6 ];
A[ 6 ] := k;

Слайд 32

k
i=4
1
2
3
4
4
5
6
8
10
9
j :=1 to 6
j :=
6
if A[ 6 ] > A[ 7

] then begin
k := A[ 6 ];
A[ 6 ] := A[ 7 ];
A[ 7 ] := k;

Слайд 33

k
i=5
1
2
3
4
4
5
6
8
10
9
j :=1 to 5
j :=
1
if A[ 1 ] > A[ 2

] then begin
k := A[ 1 ];
A[ 1 ] := A[ 2 ];
A[ 2 ] := k;

Слайд 34

k
i=5
1
2
3
4
4
5
6
8
10
9
j :=1 to 5
j :=
2
if A[ 2 ] > A[ 3

] then begin
k := A[ 2 ];
A[ 2 ] := A[ 3 ];
A[ 3 ] := k;