The Code for Bubble Sort

public void sort() {

int hold; // temporary holding area for swap

// passes

for ( int pass = 1; pass < a.length; pass++ )

// one pass

for ( int i = 0; i < a.length - 1; i++ )

// one comparison

if ( a[ i ] > a[ i + 1 ] ) {

// one swap

hold = a[i]; a[ i ] = a[ i + 1 ]; a[ i + 1 ] = hold;

}

}

Nested for loops

Previous slide

Next slide

Back to first slide

View graphic version