Pseudocode Mencari Nilai Belah Ketupat

program Belah_Ketupat;

{I.S. : User memasukkan N}

{F.S. : Menampilkan angka berbentuk belah ketupat}

Kamus:

   Nma: 1000

   A : array [ a...Nmax , a...Nmax] of integer;

   a,b,c,N : integer;

algoritma:

     input(N);

     while(N mod 2 = 0) and (N > Nmax) do;

       input(N);

     endwhile

       for a := 1 to N do

        for b := a to N do

          A[a,b] := 0;

       end;

        end;

          c := (1+N) div 2;

          N[a,c] := 1;

          for a := 2 to N do

           if a := (N div 2);

            then

             for a := (1-(a-1)) to (K+(A-1)) do

              A[a,b] := 2q-1;

             end;

       else

        for b := (a-k+1) to (a-a+k);

          A[a,c] := 2(N-a+1);

        end;

       end;

      end;

end

Menghitung T(n)

C(n)	Cop
+        = 5 -        = 7 >        = 1 input    = 2	a b c d	5n 7n n+1 1n+1

T(n) = Cop . C(n

     = (5n.a)+(7n.b)+(n+1)c+(1n+1)d