Question

Adapt the bubble sort algorithm so that it stops when no interchanges are required. Express this more efficient version of the algorithm in pseudo code?

Short answer

not given

Step-by-step solution

                                                                                                                                   

To stop the algorithm when no interchange is required, we have to begin with comparing first two elements in the list. If second element is greater than the first interchange the second element with first else keep unchanged

Step 2

Similarly, compare second & third element and third & fourth element and so on. If the succeeding element is greater than the predecessor, interchange it. If not keep unchanged. This is the first pass of the bubble sort algorithm

Step 3

In second pass, repeat the steps followed in first pass. After the comparison of all the elements, check whether the elements are in ascending order. If it is in ascending order terminate the pass to get a sorted list. If not move to the third pass again repeat first pass until we get a list in ascending order

Final answer                                                                                                                        

Efficient version of the algorithm in pseudo code

Procedure bubble sort (a_1,a_2,…,a_n: real numbers n2)

for i:=1 to n-1

for j:=1 to n-i

if a_j > a_j+1 then interchange a_jand a_j+1

( a_1,a_2,…,a_n is in increasing order)