Broken Sort Algorithm

An incomplete/broken sorting algorithm implementation. Attempts to sort an array but contains bugs (swap procedure doesn't actually swap array elements). Demonstrates a flawed sorting approach.

Source Code:

program s;

uses dos,crt;

var a: array[1..100] of integer;
    c: integer;

procedure fill;
var i: integer;
begin
for i:=1 to 100 do
a[i]:=random(222);
end;

procedure swap(i1,i2:integer);
var c: integer;
begin
c:=i1;
i1:=i2;
i2:=c;
end;

function find:integer;
var i: integer;
begin
for i:=1 to 100-1 do
if a[i] < a[i+1] then find:=i else find:=-1
end;

begin
while find= -1 do swap(a[find],a[find+1]);

end.