Data Structures Using C, 2nd Edition by Pearson

114 Data Structures Using C

loop and inner For loop. The inner For loop makes a pass on the list. If during the pass, any exchange(s)

is made then it is recorded in a variable called flag, i.e., flag is set to false. The outer while loop keeps

track of the flag. As soon as the flag informs that no exchange(s) took place during the current pass

indicating that the list is now sorted, the algorithm stops.

Fig. 3.14 Second pass of the bubble sort

8 9 10 11 19 12 13 20

8 9 10 11 12 19 13 20

8 9 10 11 12 13 19 20

Fig. 3.13 First pass of bubble sort on a list of numbers

8 20 9 10 11 19 12 13

8 9 20 10 11 19 12 13

8 9 10 20 11 19 12 13

8 9 10 11 20