void bubble(int r[], int length) { 
\c{\fbox{bubble}}
int k = length; int sorted = 0; while ( ( k > 0 ) && !sorted ) { sorted = 1; for( int j = 0; j < k ; j++ ) if ( r[j] > r[j+1] ) { swap(r[j], r[j+1]); sorted = 0; } k = k - 1; } }
\nop{

Input

  • $100% instruction coverage -- $5,3
  • $100% condition coverage -- $5,3,7

slide: The bubble function