Question

Problem 9. (10 pts.) Sort the sequence [8.7.4,9,2,5) using the Bubble sort algorithm below. Show the sequence in each step. 2) procedure bubble sort (01.02....s: real numbers with n for i:=1 to n-1 for j :=1 to n i if a; > +1 then interchange a; and 4+1 return ({01.02...., in increasing order) Fill in the following worksheet with the sorted list in the end of each step. You may not use all of the blanks 7.8.4.9.2,5 j=2

Please also give the explanation thanks

Answer 1

Completing the table,we have:

	i=1	i=2	i=3	i=4	i=5
j=1	7,8,4,9,2,5	4,7,8,2,5,9	4,7,2,5,8,9	2,4,5,7,8,9	2,4,5,7,8,9
j=2	7,4,8,9,2,5	4,7,8,2,9,5	4,2,7,5,8,9	2,4,5,7,8,9	xxx
j=3	7,4,8,9,2,5	4,7,2,8,5,9	4,2,5,7,8,9	xxx	xxx
j=4	7,4,8,2,9,5	4,7,2,5,8,9	xxx	xxx	xxx
j=5	7,4,8,2,5,9	xxx	xxx	xxx	xxx

here xxx= Loop Conditions Terminated

Given Array ={8,7,4,9,2,5}

PAAS 1:

8,7,4,9,2,5 -->7,8,4,9,2,5 [Algorithm compares the first two elements and swaps since 8>7]

7,8,4,9,2,5 --> 7,4,8,9,2,5 [since 8>4 ,swap]

7,4,8,9,2,5--> 7,4,8,9,2,5 [since 9>8,no swap]

7,4,8,9,2,5-->7,4,8,2,9,5 [since 9>2, swap]

7,4,8,2,9,5-->7,4,8,2,9,5 [since 9>5,swap]

PAAS 2:

7,4,8,2,9,5 -->4,7,8,2,5,9   [since 7>4 swap]

4,7,8,2,5,9-->4,7,8,2,9,5 [since 8>7 no swap]

4,7,8,2,9,5-->4,7,2,8,5,9   [ since 8>2 swap]

4,7,2,8,5,9-->4,7,2,5,8,9 [ since 8>5 swap]

PAAS 3:

4,7,2,5,8,9 -->4,7,2,5,8,9 [since 7>4 no swap]

4,7,2,5,8,9-->4,2,7,5,8,9 [since 7>2,swap]

4,2,7,5,8,9-->4,2,5,7,8,9 [ since 7>5 swap]

PAAS 4:

4,2,5,7,8,9 -->2,4,5,7,8,9 [since 4>2 swap]

2,4,5,7,8,9-->2,4,5,7,8,9 [since 4<5 no swap]

Now, the array is sorted but the algorithm does not know about it, hence it will cover another pass.

PAAS 5:

2,4,5,7,8,9 -->2,4,5,7,8,9

Hence the above array is sorted.

ThankYou