Code Modifications

// Add bounds of b[f..j-1] and b[j+1..k] to c

// --put larger segment on first

if (j-f > l-j) {

c[i]= new Bounds (f,j-1); i= i+1;

c[i+1]= new Bounds(j+1..k); i= i+1;

}

else {

c[i]= new Bounds (j+1..k); i= i+1;

c[i]= new Bounds(f,j-1); i= i+1;

} }

Previous slide

Next slide

Back to first slide

View graphic version