Przepisz kod na pseudokod.
for(int i=0; i <= n; i++) {
int x = A[i];
for(int j=0; j < n; j++) {
if(x == A[j]) {
A[j] = -1;
}
}
}
// For each number in list A, check whether it is present in the list again and if it is, replace it with -1
FOR i = 0 TO n 
x = A[i] 
FOR j = 0 TO n 
IF x = A[j]
A[j] = -1 
END IF 
END FOR 
END FOR