Bubble Sort Algorithm
FOR i = 1 to n-1 DO
j=i; (*look at current pair & see if we can swap*)
WHILE (A[j] > A[j+1])DO
temp := A[j]; (* swap *)
A[j] := A[j+1];
A[j+1] := temp;
IF j<> 0 (* now look at next pair back *)
THEN
j := j-1;
END
END
END
Previous slide
Next slide
Back to first slide
View graphic version