Fibonacci Series Program in C++

This C++ Program generates Fibonacci Series upto 1000. Here the first two numbers in the Fibonacci Series are 0 and 1 and the rest of the numbers are obtained by adding previous two numbers.

Here is source code of the C++ program which generates Fibonacci Series upto 1000. The C++ program is successfully compiled and run on a Linux system. The program output is also shown below.

  1. /*
  2.  * C++ program to generate fibonacci series upto 1000
  3.  */
  4. #include<iostream>
  5. using namespace std;
  6.  
  7. int main()
  8. {
  9.     int fib1 = 0, fib2 = 1, fib3 = 1;
  10.  
  11.     cout << "The Fibonacci Series is follows : " << endl << fib1 << " " << fib2 << " ";
  12.     while (fib1 + fib2 < 1000)
  13.     {
  14.         fib3 = fib1 + fib2;
  15.         fib1 = fib2;
  16.         fib2 = fib3;
  17.         cout << fib3 << " ";
  18.     }
  19.     cout << endl;
  20.  
  21.     return 0;
  22. }

$ g++ main.cpp
$ ./a.out
The Fibonacci Series is follows :
0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987

Sanfoundry Global Education & Learning Series – 1000 C++ Programs.

advertisement
advertisement
If you wish to look at all C++ Programming examples, go to C++ Programs.

If you find any mistake above, kindly email to [email protected]

advertisement
advertisement
Subscribe to our Newsletters (Subject-wise). Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with latest contests, videos, internships and jobs!

Youtube | Telegram | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & discussions at Telegram SanfoundryClasses.