1. Fibonachi
Algoritma
input(n)
awal ← 0
akhir ← 1
for i=1 to n do
output(akhir)
fibo ← awal + akhir
awal ← akhir
akhir ← fibo
Kompleksitas Waktu
Senin, 28 November 2016
Selasa, 01 November 2016
MEMBUKTIKAN NOTASI ASIMTOTIK ( BIG OH,BIG OMEGA, BIG THETA)
1. procedure
kali_matriks(d,e,f : integer; a,b : matriks; input c : matriks)
kamus
x,y,z : integer
algoritma
for x ←1 to d do
for
y ←1 to f do
for z ←1 to e do
c[x,y] ← c[x,y] + a[x,z]*b[z,y]
endfor
endfor
Tmin = 1
RUMUS Big Omega (O)
Langganan:
Postingan (Atom)