Stack Ascending bilangan genap dengan menggunakan Pascal

program stackk;
uses crt;
type stack = record
top : 0..100;
isi : array [0..100] of integer;
end;
var s1, s2 : stack;
n1, n2, i, hasil : integer;
procedure inisialisasi (var s:stack);
begin
s.top := 0;
end;
procedure push (var s:stack; x:integer);
begin
s.top := s.top + 1;
s.isi[s.top] := x;
end;
procedure pop(var s:stack; var x:integer);
begin
x := s.isi[s.top];
s.top := s.top - 1;
end;
function cekosong(var s:stack) : boolean;
begin
cekosong := false;
if s.top = 0 then
cekosong := true;
end;
procedure tukar(var p, q : integer);
var r : integer;
begin
r := p;
p := q;
q := r;
end;

begin
inisialisasi(s1); inisialisasi(s2);
write('Masukkan Nilai Pertama : '); readln(n1);
write('Masukkan Nilai Kedua : '); readln(n2);
if n1 > n2 then tukar (n1, n2);
for i := n1 to n2 do
push(s1, i);
repeat
pop(s1,hasil);
if (hasil mod 2 = 0) then
push (s2, hasil);
until cekosong(s1);
write('Urutan Bilangan Genap <Ascending> : ');
repeat
pop (s2, hasil);
write(hasil : 4);
until cekosong(s2);
readln;
end.

silahkan download disini programnya: http://www.4shared.com/file/-vdWtIOp/STACK_Genap_Ascending.html