Welcome to the Lounge

for i := 1 step 1 until m do.
if A[i] = x then go to found fi;
not found: i := re+l; m := i;
A[i] := x; B[i] := 0;
found: B[i] := B[i]+I; 

i:=1;
while i < m and A[i] # x do i :-- i+1;
if i > m then ra := i; A[i] := x; B[i] ::= 0 fi;
B[i] := B[i]+I; 

for i in 1:m do

  // main loop body; may contain any number of statements:

  while A[i] != x;  // premature loop termination if x is found   

exitwhile           // do this on premature loop termination, i.e. "found"
  B[i]++; 

exitfor             // do this if loop reaches end of (valid) A[], i.e. "not found"
  A[i] := x;
  B[i] := 1;
  m = i;            // new search limit for subsequent x searches

endfor

honey the codewitch wrote:

for i := 1 step 1 until m do.
if A[i] = x then go to found fi;
not found: i := re+l; m := i;
A[i] := x; B[i] := 0;
found: B[i] := B[i]+I;

for i := 1 step 1 until m do.
   if A[i] = x then go to found fi;
not found: i := m+1; m := i;
A[i] := x; B[i] := 0;
found: B[i] := B[i]+1;

for (;;)
{
    Console.WriteLine("this, and while(true) loops, are an abomination ... as evil as using goto");

    goto get_me_out_of_here;
}

get_me_out_of_here:

#define ever (;;)

for ever {...}