try this following code :
{********************************************
* This Procedure to Sort element vektor *
* Procedure ATUR to organize an element position *
...

yeah. i will give u QuickSort procedure

i was modified your code and add a some code :
i use your initial code...
function POP (var T : Tumpukan) : integer;

{*this function to check stack is empty or not*}
function Empty(var T :...

try this following code :
program Reverse_String;

uses crt;

const Elemen = 255; {* Max character *}

type S255 = string[Elemen];
Stack = record
Input :...

see this code :
function FIBO(N : integer) : integer;

begin
if (N = 1) or (N = 2) then
FIBO := 1
else
FIBO(N) := FIBO(N - 1) + FIBO(N - 2)
end;
hope this helps...

i think you forget to set full = false, just it.
add this code after else :
begin
Full := false;
T.Top := inc(T.Top);
T.Contain[T.Top] := X
end
ok hope this...

sorry for the double post.

see this example :
i write this code in pascal

5318

hope this helps..

see this example :
i write this code in pascal

5318

hope this helps..