{ perm1.txt -- Algorithm #2: Permutation One by Tom Swan }

procedure Permute(n: Integer);
begin
  if n = 1 then Show array else
  begin
    Permute(n - 1);
    for i <- 1 to n - 1 do
    begin
      Swap a[i] and a[n];
      Permute(n - 1);
      Swap a[i] and a[n];
    end;
  end;
end;


(*
// ---------------------------------------------------------------
// Copyright (c) 1993 by Tom Swan. All rights reserved
// Revision 1.00    Date: 02/13/1993   Time: 02:27 pm
*)
