Сортировка массива

uses crt;
var mas: array [1..20] of char;
    c, h: char;
    i, j, k: integer;
begin
for i := 1 to 20 do read(mas[i]);
for i := 1 to 20 do
 begin
    c := mas[i];
    for j := i to 20 do
     if(c>=mas[j]) then
      begin
         c := mas[j];
         k := j;
      end;
    h := mas[k];
    mas[k] := mas[i];
    mas[i] := h;
 end;
for i := 1 to 20 do write(mas[i], ' ');
readln;
end.

uses crt;
var mas: string[21];
    c, h: char;
    i, j, k, x: integer;
begin
read(mas);
x := length(mas);
for i := 1 to x do
 begin
    c := mas[i];
    for j := i to x do
     if(c>=mas[j]) then
      begin
         c := mas[j];
         k := j;
      end;
    h := mas[k];
    mas[k] := mas[i];
    mas[i] := h;
 end;
for i := 1 to x do write(ord(mas[i]), ' ');
readln;
end.

var
m[1..10]: array of char;
a: char;
n, i: integer;
Begin
readln(n);
for i:=1 to n do begin
Readln(m[i]);
end;
For i:=1 to n do begin
For j:=1 to n-1 do begin
if ord(m[j])<ord(m[j+1]) then begin a:=m[j]; m[j]:=m[j+1]; m[j+1]:=a; end;
end;
end;
for i:=1 to n do begin
Writeln(m[i]);
end;
end.

procedure qSort(l,r:longint);
  var i,j:longint;
    w,q:char;
  begin
    if l=r then exit;
    i := l; j := r;
    q := a[(l+r) div 2];
    repeat
      while (a[i] < q) do inc(i);
      while (q < a[j]) do dec(j);
      if (i <= j) then
    begin
      w:=a[i]; a[i]:=a[j]; a[j]:=w;
      inc(i); dec(j);
    end;
    until (i > j);
  if (l < j) then qSort(l,j);
  if (i < r) then qSort(i,r);
end;