How to print all possible permutations (all possible orderings) of the words in Pascal

1 Answer

0 votes
program PermutationProgram;

uses
  SysUtils;

procedure PrintPermutations(words: array of string; n: integer);
var
  i, j, k: integer;
begin
  for i := 0 to High(words) do
    for j := 0 to High(words) do
      for k := 0 to High(words) do
        if (i <> j) and (j <> k) and (i <> k) then
        begin
          WriteLn(words[i], ', ', words[j], ', ', words[k]);
        end;
end;

var
  words: array[0..2] of string = ('Pascal', 'Programming', 'Language');
begin
  PrintPermutations(words, Length(words));
end.





(*
run:

Pascal, Programming, Language
Pascal, Language, Programming
Programming, Pascal, Language
Programming, Language, Pascal
Language, Pascal, Programming
Language, Programming, Pascal

*)

 



answered Jan 21, 2025 by avibootz

Related questions

...