for p for p 2 to n do A[p] 2 to n do if A[p] =0...

Transcribed Image Text:

for p for p 2 to n do A[p] 2 to n do if A[p] =0 j p* p while j < n do A[j] 0 jj + p for p - 2 to n do if A[p] #0 //copy the remaining elements of A to array L of the primes i0 L[i] A[p] ii +1 p //see note before pseudocode //p hasn't been eliminated on previous passes return L //mark element as eliminated for p for p 2 to n do A[p] 2 to n do if A[p] =0 j p* p while j < n do A[j] 0 jj + p for p - 2 to n do if A[p] #0 //copy the remaining elements of A to array L of the primes i0 L[i] A[p] ii +1 p //see note before pseudocode //p hasn't been eliminated on previous passes return L //mark element as eliminated