Algorithm BubbleSort(data[],n)

 

For pass = 1 to n-1

a. Initially in a pass,assume no interchanges

Interchange <- FALSE

b. For(i=0 to (n-pass)

If data[i]>data[i+1]

Then [interchange elements]

i. data[i] <-> data [i+1]

ii. Interchange <- TRUE

c. If (Interchage = FALSE)

Then

Return

End

 

Explanation

 

1. The algorithm for bubble sort requires a pair of nested loops.


2. The outer loop must iterate once for each element in the data set (of size n) while the inner loop iterates n times the first time it is entered, n-1 times the second, and so on.


3. Bubble sort is structured so that on each pass through the list the next largest element of the data is moved to its proper place. Therefore, to get all n elements in their correct places, the outer loop must be executed n-1 times.


4. The inner loop is executed on each iteration of the outer loop.


5. Its purpose is to put the next largest element is being put into place. The inner loop therefore does the comparing and swapping of adjacent elements.