Archive for Januari 2013
Pseudocode Deret Fibonacci
Begin
int a = 1
int b = 1
int c = 0
int i = 0
int nNilai
Print ("Masukkan nilai")
Accept nNilai
For (i = 1; i <= nNilai; i++)
{
if (i < 2 )
{
a = 1
i = i + 1
}
else
{
c = a
a = b + a
b = c
i = i + 1
}
end if
Print (" ")
}
End
int a = 1
int b = 1
int c = 0
int i = 0
int nNilai
Print ("Masukkan nilai")
Accept nNilai
For (i = 1; i <= nNilai; i++)
{
if (i < 2 )
{
a = 1
i = i + 1
}
else
{
c = a
a = b + a
b = c
i = i + 1
}
end if
Print (" ")
}
End
Segitiga Pascal
Begin
var
Num : array [0..99] int;
i,j,k,n : int;
Int iLevel
Print ('Masukkan Level');
Accept iLevel
for (i=0; i<=iLevel; i++)
var
Num : array [0..99] int;
i,j,k,n : int;
Int iLevel
Print ('Masukkan Level');
Accept iLevel
for (i=0; i<=iLevel; i++)
{
for
(k=0; k<=((2*nilai)-(2*i)); k++){
print(" ");
{
for (j=0; j<=i; j++){
if (j==0||i==j){
n=1;
}
else{
n=n*(i+1-j)/j;
}
print("%5i", n);
print("\n");
}
End
