Notice: This page requires JavaScript to function properly.
Please enable JavaScript in your browser settings or update your browser.Fibonacci Number with Loops | Introduction to Program Flow
C++ Introduction
course content

Course Content

C++ Introduction

C++ Introduction

1. Getting Started
Why to Learn C++What is C++Entry Point of a ProgramStandard Library and FilesPreprocessor DirectivesThe First Program
2. Variables and Data Types
Data TypesUnderstanding VariablesNumerical Data TypesIntroduction to StringIntroduction to ArraysKeywords sizeof(), auto and typedefWorking with the Array
3. Introduction to Operators
Simple OperatorsA Little MathLogical OperatorsCompound Assignment OperatorPracticing Math Basics
4. Introduction to Program Flow
If...else StatementTernary OperatorSwitch StatementWhile LoopDo...while LoopFor LoopFibonacci Number with Loops
5. Introduction to Functions
What are Functions?Type of FunctionsReturn Statement in FunctionsFunctions With Arguments Simple Function

bookFibonacci Number with Loops

Note

In the Fibonacci sequence, the indexing starts from zero:

  • F(0) = 0
  • F(1) = 1

For any n, the n-th Fibonacci number can be calculated based on the preceding two numbers in the sequence. For example, F(2) = F(1) + F(0) and so on.

Task

  • Implement a loop structure to find the 15th Fibonacci number.
  • Output the found number.

Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
Everything was clear?

How can we improve it?

Thanks for your feedback!

Section 4. Chapter 7
toggle bottom row

bookFibonacci Number with Loops

Note

In the Fibonacci sequence, the indexing starts from zero:

  • F(0) = 0
  • F(1) = 1

For any n, the n-th Fibonacci number can be calculated based on the preceding two numbers in the sequence. For example, F(2) = F(1) + F(0) and so on.

Task

  • Implement a loop structure to find the 15th Fibonacci number.
  • Output the found number.

Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
Everything was clear?

How can we improve it?

Thanks for your feedback!

Section 4. Chapter 7
toggle bottom row

bookFibonacci Number with Loops

Note

In the Fibonacci sequence, the indexing starts from zero:

  • F(0) = 0
  • F(1) = 1

For any n, the n-th Fibonacci number can be calculated based on the preceding two numbers in the sequence. For example, F(2) = F(1) + F(0) and so on.

Task

  • Implement a loop structure to find the 15th Fibonacci number.
  • Output the found number.

Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
Everything was clear?

How can we improve it?

Thanks for your feedback!

Note

In the Fibonacci sequence, the indexing starts from zero:

  • F(0) = 0
  • F(1) = 1

For any n, the n-th Fibonacci number can be calculated based on the preceding two numbers in the sequence. For example, F(2) = F(1) + F(0) and so on.

Task

  • Implement a loop structure to find the 15th Fibonacci number.
  • Output the found number.

Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
Section 4. Chapter 7
Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
some-alt