Posted in April 15, 2010 ¬ 9:33 pmh.cuplis
nih mumpung masih hangat, salah satu algoritma deret fibonacci :
flowchart :
contoh program :
$limit = 10;
$fibonacci = "";
for($i=1;$i<=$limit;$i++){
if($i == 1){
$value[$i]=1;
}else{
$value[$i]=$value[$i-2] + $value[$i-1];
}
$fibonacci .= $value[$i]." ";
}
echo $fibonacci;
output :
1 1 2 3 5 8 13 21 34 55
Bookmarks:
Read the rest of this entry »
Posted in April 15, 2010 ¬ 8:16 pmh.cuplis
mumpung masih hangat, berikut ini salah satu contoh algoritma segitiga pascal beserta contoh codingnya di php
flowchart :
contoh program :
$limit = 6;
$pascal = "";
for($i=1;$i<=$limit;$i++){
for($j=1;<=$i;$j++){
if($j==1 || $j==$i){
$value[$i][$j] = 1;
}else{
$value[$i][$j] = $value[$i-1][$j] + $value[$i-1][$j-1];
}
$pascal .= $value[$i][$j]." ";
}
$pascal .= "
\n";
}
echo $pascal;
output :
Bookmarks:
Read the rest of this entry »
Posted in May 30, 2009 ¬ 11:05 amh.cuplis
hitung jumlah simpul :
Q = FIRST;
Jum = 1;
while (Q != LAST)
{ Q = Q->LINK;
Jum = Jum + 1;
}
printf("%i", JUM);
atau
Q = FIRST;
Jum = 1;
while (Q->LINK != NULL)
{ Q = Q->LINK;
Jum = Jum + 1;
}
printf("%i", JUM);
atau
Q = FIRST;
Jum = 0;
while (Q [...]
Read the rest of this entry »
Posted in May 30, 2009 ¬ 10:23 amh.cuplis
ciri2 double ended queue :
kosong : L = R + 1
penuh kanan : R = n – 1
penuh kiri : L = 0
penuh kanan dan kiri : R = n – 1 && L = 0
bisa diisi dari kanan : R < n
bisa diisi dari kiri : L > 0
ada isinya : L < R [...]
Read the rest of this entry »
Posted in May 30, 2009 ¬ 9:43 amh.cuplis
ciri2 circular queue :
kosong : counter = 0
penuh : counter = n
bisa diisi : counter < n
ada isinya : counter > 0
kondisi awal :
f = 0;
r = -1;
counter = 0;
algoritma dasar circular queue :
INSERT
R = (R+1) % n;
Q[R] = X;
Counter++;
DELETE
X = Q[F];
[...]
Read the rest of this entry »
Posted in May 30, 2009 ¬ 9:00 amh.cuplis
ciri2 double stack :
stack 1 kosong : top1 = -1
stack 2 kosong : top2 = n
stack penuh (stack 1 dan stack 2 tidak bisa diisi) : top2 – top1 = 1
stack bisa diisi (stack 1 dan stack 2 tidak bisa diisi) : top2 – top1 > 1
stack 1 ada isinya : top1 > -1
stack 2 [...]
Read the rest of this entry »