PPT Slide

(d) j= k-1; x= 0;

// Invariant P (see the problem description)

while (h <= j)

{x= x+b[j]; j= j-1; }

(e) j= 1;

// Invariant P (see the problem description)

while (j <= n)

j= 2*j;

(f) j= 1;

// Invariant P (see the problem description)

while ( j*j <= n)

j= j+1;

j= j*j;

(g) j= k;

// Invariant P (see the problem description)

while (x != b[j])

j= j-1;

(h) k= a+1; x= m[a];

// Invariant P (see the problem description)

while (k != b) {

if (m[k] > x)

x= m[k];

k= k+1;

}

(i) k= b; x= m[b];

// Invariant P (see the problem description)

while (k != a) {

k= k-1;

if (m[k] > x)

x= m[k];

}

(j) k= b; h= b;

// Invariant P (see the problem description)

while (a != k) {

k= k-1;

if (m[h] < m[k])

h= k;

}

(k) j= b+1;

// Invariant P (see the problem description)

while ( a < j ) {

j= j-1;

Store in h the index of the maximum value

of m[a..j];

Swap m[h] and m[j];

}

(l) j= n+1; ev= 0; od= 0;

// Invariant P (see the problem description)

while (j > 0) {

j= j-1;

if (b[j] % 2 = 0) ev= ev+1;

else od= od+1;

}

(m) h= 0; j= 0;

// Invariant P (see the problem description)

while (j < b.length-1) {

j= j+1;

if ( b[h].length > b[j] ) h= j;

}

(n) m= 1; n= 0;

// Invariant P (see the problem description)

while (m != month) {

n= n + b[m]; m= m+1;

}

n= n + day;

(o) h= 1; y= 0, x= 1;

// Invariant P (see the problem description)

while ( h != n) {

h= h+1;

int t= x; x= x+y; y= t;

}

(p) r= n;

// Invariant P (see the problem description)

while (r >= m)

{r= r-m;}

Previous slide

Back to first slide

View graphic version