Upload
others
View
3
Download
0
Embed Size (px)
Citation preview
Bubble Sort
Idea
2
6 1 3 2 1
Idea
3
6 1 3 2 1
6 > 1
Idea
4
1 6 3 2 1
6 > 1
Idea
5
1 6 3 2 1
Idea
6
1 6 3 2 1
6 > 3
Idea
7
1 3 6 2 1
6 > 3
Idea
8
1 3 6 2 1
Idea
9
1 3 6 2 1
6 > 2
Idea
10
1 3 2 6 1
6 > 2
Idea
11
1 3 2 6 1
Idea
12
1 3 2 6 1
6 > 1
Idea
13
1 3 2 1 6
6 > 1
Idea
14
1 3 2 1 6
6 > 1
Note:
6 is maximum
Idea
15
1 3 2 61
Idea
16
1 3 2 61
1 < 3
Idea
17
1 3 2 61
Idea
18
1 3 2 61
3 > 2
Idea
19
1 2 3 61
3 > 2
Idea
20
1 2 3 61
Idea
21
1 2 3 61
3 > 1
Idea
22
1 2 1 63
3 > 1
Idea
23
631 2 1
Idea
24
631 2 1
1 < 2
Idea
25
631 2 1
Idea
26
631 2 1
1 < 2
Idea
27
631 1 2
1 < 2
Idea
2
28
631 1
Idea
2
29
631 1
1 == 1
Idea
2
30
1 631
Idea
2
31
1 631
Sorted
Algorithm – Bubble Sort
Algorithm – Bubble Sort
33
int a[] = {6, 1, 3, 2, 1};
for (int i = 4; i >= 0; --i)
for (int j = 0; j < i; ++j)
if (a[j] > a[j+1]) {
int temp = a[j];
a[j] = a[j+1];
a[j+1] = temp;
}
Algorithm – Bubble Sort
34
int a[] = {6, 1, 3, 2, 1};
for (int i = 4; i >= 0; --i)
for (int j = 0; j < i; ++j)
if (a[j] > a[j+1]) {
int temp = a[j];
a[j] = a[j+1];
a[j+1] = temp;
}
1 3 2 61
Note:
Do not considerprevious maxima.