type Permutation is array(Positive range <>) of Positive;
   Grenze : Positive; -- fuer ein Get() in der procedure ... hier nicht angegeben.
   Instanz : Permutation(1..Grenze);
   Zaehler : Integer;
   function Ist_Permutation(A : Permutation) return Boolean is
   begin
      for index in A'Range loop
	     Zaehler := 0;
	     for element in A'Range loop
		    if A(index) = A(element) then
			   Zaehler := Zaehler + 1;
			else 
			   null;
			end if;
			if Zaehler > 1 then
			   return False;
			end if;
		 end loop;
	  end loop;
	  return True;
   end Ist_Permutation;

if ((index != element) && (index == element))
{
    return false;
}

int[] permutation = ...;
int length = permutation.Length;
for (int i = 0; i < length; i++)
{
    for (int u = 0; u < i; u++)
    {
        if (permutation[i] == permutation[u])
        {
            return false;
        }
    }
}

for (int i = 0; i < arraylaenge; i++) {
  for (int i = 0; i < arraylaenge; i++) {
    if (array[i] == array[j]) {
      return false;
    }
  }
}