41775

Avoiding goto • Codę involving a gotocan always be written without one,

which may reąuire morę coding (additional variables and tests): found = 0;

for (i = 0; i< n && Ifound; i++) for (j = 0; j < m && Ifound; j++) if (a[i] == b[j]) found = 1; if (found)

I* got one: a[i-1] == b[j-1] */ else

r didn't find any common element */