bengkeng

Secara teorinya...hmmmm ( Sila berkenalan dengan Fibonaci terlebih dahulu ok... )

Diambil dari sini

In mathematics, the Fibonacci numbers, named after Leonardo of Pisa, known as Fibonacci, form a sequence defined recursively by:

In other words, after two starting values, each number is the sum of the two preceding numbers. The first Fibonacci numbers (sequence A000045 in OEIS) for n = 0, 1, … are

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, …

...........................................................................................

so ape kata kalau kita buat 'code' dalam aturcara kita supaya dapat 'output' seperti di atas. Akhirnya dengan menggunakan compiler c# (Visual Studio.NET) akhirnya berjaya jugak. Dan kodnya seperti dibawah

.............................................................................................

using System;
namespace Fibonacci
{
class Class1
{
static void Main(string[] args)
{
int n0=1, n1=1,n2;
Console.WriteLine(n0 + " " + n1 + "");
for(int i=0;i<18;i++) {
n2=n1 + n0;
Console.WriteLine(n2 + "");
n0=n1; /* area ni aku amik mase sikit */
n1=n2; /* seperti di atas */
}
Console.WriteLine();
}
}
}

.........................................................................................................

dan akhirnya cube 'lari'kan kod ni untuk dapatkan outputnya ( walaupun susunan output macam tak betul... (X<)..... )