Úvod do série Fibonacci v C ++
Fibonacciho řada je řada čísel. Vytváří řetězec čísel přidávající poslední dvě čísla. Vypočítání řady Fibonacci je snadné, protože k získání další číslice stačí přidat poslední dvě číslice. Ale v určitém okamžiku, kdy se počet číslic stane obrovským, je to docela složité. Abychom tento problém vyřešili, uvidíme, jak můžeme vytvořit program řady Fibonacci v jazyce C ++, aby se stal snadným. Podívejme se, jak Fibonacciho série skutečně funguje.
Nechť f (n) je deváté funkční období.
f (0) = 0;
f (1) = 1;
Série budou následující:
1 (1 + 0)
2 (1 + 1)
3 (1 + 2)
5 (2 + 3)
8 (3 + 5)
13 (5 + 8)
21 (8 + 13
…a tak dále
Logika za generováním série Fibonacci
- Inicializujte první číslo na 0
- Inicializujte druhé číslo na 1
- Přidejte první a druhé číslo.
- Uložte hodnotu přidání do třetího čísla.
- Vytiskněte třetí číslo.
- Přiřaďte druhé číslo prvnímu číslu
- Přiřaďte třetí číslo druhému číslu.
- Opakujte kroky 3 až 7, dokud se pro daný počet nevypočítá série Fibonacci.
Programy řady Fibonacci v C ++
V této sekci se podíváme, jak zjistit řadu Fibonacci pomocí různých metod, jako je rekurze, smyčka, pole, bez rekurze atd.:
1. Bez metody rekurze
Kód:
#include
using namespace std;
int main()
(
int first_num = 0, second_num = 1, third_num, i, num;
cout << "Enter random number to print fibonacci series:";
cin >> num;
cout << "Fibonacci Series for a given number:" < cout << first_num < cout << second_num << endl;
for(i = 2; i < num; ++i) //loop will starts from 2 because we have printed 0 and 1 before
(
third_num = first_num + second_num;
cout << third_num << endl;
first_num = second_num;
second_num = third_num;
)
return 0;
)#include
using namespace std;
int main()
(
int first_num = 0, second_num = 1, third_num, i, num;
cout << "Enter random number to print fibonacci series:";
cin >> num;
cout << "Fibonacci Series for a given number:" < cout << first_num < cout << second_num << endl;
for(i = 2; i < num; ++i) //loop will starts from 2 because we have printed 0 and 1 before
(
third_num = first_num + second_num;
cout << third_num << endl;
first_num = second_num;
second_num = third_num;
)
return 0;
)#include
using namespace std;
int main()
(
int first_num = 0, second_num = 1, third_num, i, num;
cout << "Enter random number to print fibonacci series:";
cin >> num;
cout << "Fibonacci Series for a given number:" < cout << first_num < cout << second_num << endl;
for(i = 2; i < num; ++i) //loop will starts from 2 because we have printed 0 and 1 before
(
third_num = first_num + second_num;
cout << third_num << endl;
first_num = second_num;
second_num = third_num;
)
return 0;
)
Výstup:
2. Pomocí metody rekurze
Kód:
#include
using namespace std;
void FibonacciSeries(int num)
(
static int first_num = 0, second_num = 1, third_num;
if(num > 0)
(
third_num = first_num + second_num;
first_num = second_num;
second_num = third_num;
cout << third_num << endl;
FibonacciSeries(num - 1);
)
)
int main()
(
int num;
cout << "Enter random number to print fibonacci series:";
cin >> num;
cout << "Fibonacci Series for a given number: \n" << endl;
cout << "0" << endl;
cout << "1" << endl;
FibonacciSeries (num - 2); //number-2 is used because we have already print 2 numbers
return 0;
)
Výstup:
3. Použití smyčky For
Kód:
#include
using namespace std;
int main()
(
int first_num= 0, second_num = 1, third_num, i, num;
cout << "Enter random number to print fibonacci series:";
cin >> num;
cout << "Fibonacci Series for a given number:" < cout << first_num < cout << second_num < for(i = 0; i < num; i++) //loop will starts from 2 because we have printed 0 and 1 before
(
if(i <= 1)
third_num = i;
else
(
third_num = first_num + second_num;
cout << third_num < first_num = second_num;
second_num = third_num;
)
)
return 0;
)#include
using namespace std;
int main()
(
int first_num= 0, second_num = 1, third_num, i, num;
cout << "Enter random number to print fibonacci series:";
cin >> num;
cout << "Fibonacci Series for a given number:" < cout << first_num < cout << second_num < for(i = 0; i < num; i++) //loop will starts from 2 because we have printed 0 and 1 before
(
if(i <= 1)
third_num = i;
else
(
third_num = first_num + second_num;
cout << third_num < first_num = second_num;
second_num = third_num;
)
)
return 0;
)#include
using namespace std;
int main()
(
int first_num= 0, second_num = 1, third_num, i, num;
cout << "Enter random number to print fibonacci series:";
cin >> num;
cout << "Fibonacci Series for a given number:" < cout << first_num < cout << second_num < for(i = 0; i < num; i++) //loop will starts from 2 because we have printed 0 and 1 before
(
if(i <= 1)
third_num = i;
else
(
third_num = first_num + second_num;
cout << third_num < first_num = second_num;
second_num = third_num;
)
)
return 0;
)#include
using namespace std;
int main()
(
int first_num= 0, second_num = 1, third_num, i, num;
cout << "Enter random number to print fibonacci series:";
cin >> num;
cout << "Fibonacci Series for a given number:" < cout << first_num < cout << second_num < for(i = 0; i < num; i++) //loop will starts from 2 because we have printed 0 and 1 before
(
if(i <= 1)
third_num = i;
else
(
third_num = first_num + second_num;
cout << third_num < first_num = second_num;
second_num = third_num;
)
)
return 0;
)#include
using namespace std;
int main()
(
int first_num= 0, second_num = 1, third_num, i, num;
cout << "Enter random number to print fibonacci series:";
cin >> num;
cout << "Fibonacci Series for a given number:" < cout << first_num < cout << second_num < for(i = 0; i < num; i++) //loop will starts from 2 because we have printed 0 and 1 before
(
if(i <= 1)
third_num = i;
else
(
third_num = first_num + second_num;
cout << third_num < first_num = second_num;
second_num = third_num;
)
)
return 0;
)
Výstup:
4. Pomocí smyčky
Kód:
#include
using namespace std;
int main()
(
int first_num = 0, second_num = 1, third_num = 0, i = 3, num;
cout << "Enter random number to print fibonacci series:" ;
cin >> num;
cout << "Fibonacci Series for a given number:" < cout << first_num < cout << second_num < while(i <= num)
(
third_num = first_num + second_num;
cout << third_num < first_num = second_num;
second_num = third_num;
i = i + 1;
)
return 0;
)#include
using namespace std;
int main()
(
int first_num = 0, second_num = 1, third_num = 0, i = 3, num;
cout << "Enter random number to print fibonacci series:" ;
cin >> num;
cout << "Fibonacci Series for a given number:" < cout << first_num < cout << second_num < while(i <= num)
(
third_num = first_num + second_num;
cout << third_num < first_num = second_num;
second_num = third_num;
i = i + 1;
)
return 0;
)#include
using namespace std;
int main()
(
int first_num = 0, second_num = 1, third_num = 0, i = 3, num;
cout << "Enter random number to print fibonacci series:" ;
cin >> num;
cout << "Fibonacci Series for a given number:" < cout << first_num < cout << second_num < while(i <= num)
(
third_num = first_num + second_num;
cout << third_num < first_num = second_num;
second_num = third_num;
i = i + 1;
)
return 0;
)#include
using namespace std;
int main()
(
int first_num = 0, second_num = 1, third_num = 0, i = 3, num;
cout << "Enter random number to print fibonacci series:" ;
cin >> num;
cout << "Fibonacci Series for a given number:" < cout << first_num < cout << second_num < while(i <= num)
(
third_num = first_num + second_num;
cout << third_num < first_num = second_num;
second_num = third_num;
i = i + 1;
)
return 0;
)#include
using namespace std;
int main()
(
int first_num = 0, second_num = 1, third_num = 0, i = 3, num;
cout << "Enter random number to print fibonacci series:" ;
cin >> num;
cout << "Fibonacci Series for a given number:" < cout << first_num < cout << second_num < while(i <= num)
(
third_num = first_num + second_num;
cout << third_num < first_num = second_num;
second_num = third_num;
i = i + 1;
)
return 0;
)
Výstup:
5. Použití pole
Kód:
#include
using namespace std;
int main()
(
int fibonacci(25), i, num;
cout << "Enter random number to print fibonacci series:";
cin >> num;
fibonacci(0) = 0;
fibonacci(1) = 1;
for (i = 2; i < num; i++)
(
fibonacci(i) = fibonacci(i - 1) + fibonacci(i - 2);
)
cout <<"Fibonacci Series for a given number:" << endl;
for (i = 0; i < num; i++)
(
cout << fibonacci(i) < )
return 0;
)#include
using namespace std;
int main()
(
int fibonacci(25), i, num;
cout << "Enter random number to print fibonacci series:";
cin >> num;
fibonacci(0) = 0;
fibonacci(1) = 1;
for (i = 2; i < num; i++)
(
fibonacci(i) = fibonacci(i - 1) + fibonacci(i - 2);
)
cout <<"Fibonacci Series for a given number:" << endl;
for (i = 0; i < num; i++)
(
cout << fibonacci(i) < )
return 0;
)
Výstup:
6. Program řady Fibonacci v C ++ pomocí zadaného čísla
Kód:
#include
using namespace std;
int main()
(
int first_num = 0, second_num = 1, third_num, i;
cout << "Fibonacci Series for a given number:";
cout << first_num < cout << second_num < for(i = 2; i < 10; ++i) //loop will starts from 2 because we have printed 0 and 1 before
(
third_num = first_num + second_num;
cout << third_num < first_num = second_num;
second_num = third_num;
)
return 0;
)#include
using namespace std;
int main()
(
int first_num = 0, second_num = 1, third_num, i;
cout << "Fibonacci Series for a given number:";
cout << first_num < cout << second_num < for(i = 2; i < 10; ++i) //loop will starts from 2 because we have printed 0 and 1 before
(
third_num = first_num + second_num;
cout << third_num < first_num = second_num;
second_num = third_num;
)
return 0;
)#include
using namespace std;
int main()
(
int first_num = 0, second_num = 1, third_num, i;
cout << "Fibonacci Series for a given number:";
cout << first_num < cout << second_num < for(i = 2; i < 10; ++i) //loop will starts from 2 because we have printed 0 and 1 before
(
third_num = first_num + second_num;
cout << third_num < first_num = second_num;
second_num = third_num;
)
return 0;
)#include
using namespace std;
int main()
(
int first_num = 0, second_num = 1, third_num, i;
cout << "Fibonacci Series for a given number:";
cout << first_num < cout << second_num < for(i = 2; i < 10; ++i) //loop will starts from 2 because we have printed 0 and 1 before
(
third_num = first_num + second_num;
cout << third_num < first_num = second_num;
second_num = third_num;
)
return 0;
)
Výstup:
Závěr
V tomto článku jsme viděli, jak generovat řadu Fibonacci v jazyce C ++ pomocí různých metod. Doufám, že vám tento článek pomůže.
Doporučené články
Toto je průvodce Fibonacciho řadou v C ++. Zde diskutujeme různé programy řady Fibonacci v C ++. Další informace naleznete také v dalších souvisejících článcích.
- Sloučit třídění algoritmů v Javě
- ASP.NET Framework
- Palindrom v programu C
- PHP Do while Loop
- Úvod do série Fibonacci v C #
- Fibonacciho řada v Javě
- Palindrom v C ++
- Algoritmy rychlého třídění v Javě
- Do while Loop in JavaScript