Who can explain me this algorithm?

Hello everyone,

Anyone can explain me this algorithm ? thank you in advance.

WHILE (i < M) DO
    WHILE (j < N) DO
            IF (m[i][j] = elt) THEN
                exist := TRUE;
                BREAK; 
            END_IF
            j := j+1; // update index
    END_WHILE
    IF (exist = TRUE) THEN
        BREAK;
    END_IF
    i:=i+;
END_WHILE
1 Like

It searches in a two dimensional array (M x N) for a value elt.

1 Like