Реализовать рекурсивный алгоритм поиска минимального элемента массива

program Project2;
 
{$APPTYPE CONSOLE}
 
uses SysUtils;
const nmax=100;
type mas=array[1..nmax] of integer;
function min1(a,b:integer):integer;
begin
if a<b then min1:=a else min1:=b
end;
function min2(n:integer;a:mas):integer;
begin
if n=2 then min2:=min1(a[n],a[1])
else min2:=min1(a[n],min2(n-1,a));
end;
 
var a:mas;
    n,i:byte;
begin
randomize;
repeat
write('n>1  n=');
readln(n);
until n in [2..nmax];
writeln('Massiv');
for i:=1 to n do
 begin
  a[i]:=random(51);
  write(a[i]:4)
 end;
writeln;
write('Minimum=',min2(n,a));
readln
end.

unit Unit1;
 
interface
 
uses
  Windows, Messages, SysUtils, Variants, Classes, Graphics, Controls, Forms,
  Dialogs;
 
type
  TForm1 = class(TForm)
   procedure FormPaint(Sender: TObject);
    procedure FormCreate(Sender: TObject);
  private
    { Private declarations }
  public
    { Public declarations }
  end;
 
var
  Form1: TForm1;
 
implementation
 
{$R *.dfm}
//зададим некоторые параметры формы
procedure TForm1.FormCreate(Sender: TObject);
begin
Form1.ClientWidth:=500;
Form1.ClientHeight:=500;
Form1.Position:=poScreenCenter;
end;
procedure TForm1.FormPaint(Sender: TObject);
const b=100;
      n=5;
      k=0.4;
procedure storona(xa,ya,xb,yb,n:integer;k:real);
var xp,yp,xq,yq,xr,yr,xs,ys,dx,dy:integer;
begin
if n=0 then Form1.Canvas.LineTo(xb,yb)
else
 begin
  dx:=round(0.5*(1-k)*(xb-xa));
  dy:=round(0.5*(1-k)*(yb-ya));
  xp:=xa+dx;
  yp:=ya+dy;
  xs:=xb-dx;
  ys:=yb-dy;
  xq:=xp+(ys-yp);
  yq:=yp-(xs-xp);
  xr:=xq+(xs-xp);
  yr:=yq+(ys-yp);
  Form1.Canvas.LineTo(xp,yp);
  storona(xp,yp,xq,yq,n-1,k);
  storona(xq,yq,xr,yr,n-1,k);
  storona(xr,yr,xs,ys,n-1,k);
  Form1.Canvas.LineTo(xb,yb);
 end;
end;
var xc,yc:integer;
begin
xc:=Form1.ClientWidth div 2;
yc:=Form1.ClientHeight div 2;
Form1.Canvas.MoveTo(xc-b,yc-b);
storona(xc-b,yc-b,xc+b,yc-b,n,k);
storona(xc+b,yc-b,xc+b,yc+b,n,k);
storona(xc+b,yc+b,xc-b,yc+b,n,k);
storona(xc-b,yc+b,xc-b,yc-b,n,k);
end;
end.