Perl Schwartzian transform to Pascal

.pas

program SortStrings;

uses SysUtils;

var
  unsorted: array of string;
  sorted: array of string;
  i, j: Integer;
  temp: string;

begin
  unsorted := ['x', 't', 'h', 'b', 'a', 'q', 'z'];
  SetLength(sorted, Length(unsorted));

  // Sorting the array
  for i := 0 to High(unsorted) do
    sorted[i] := unsorted[i];

  for i := 0 to High(sorted) - 1 do
    for j := i + 1 to High(sorted) do
    begin
      if (Length(sorted[i]) > Length(sorted[j])) or
         ((Length(sorted[i]) = Length(sorted[j])) and (sorted[i] > sorted[j])) then
      begin
        // Swap
        temp := sorted[i];
        sorted[i] := sorted[j];
        sorted[j] := temp;
      end;
    end;

end.

.pl

#!/usr/bin/env perl
use strict;
use warnings;

my @unsorted = qw(x t h b a q z);
my @sorted = map  { $_->[0] }
             sort { $a->[1] <=> $b->[1] or $a->[0] cmp $b->[0] }
             map  { [$_, length($_)] } @unsorted;