Let’s fill in the blanks

k= ;

j= ;

while ( ) {

int e = ;

// We know that -1 <= k < e < j <= b.length

if ( b[e] <= x )

else

}

Previous slide

Next slide

Back to first slide

View graphic version