Created with <3 with dartpad.dev.
Last active
August 1, 2023 17:01
-
-
Save ervinod/c6b76f1b6d2f7fe79831f51b53642d1d to your computer and use it in GitHub Desktop.
problem-3
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| void main() { | |
| // print the fibonnaci series upto n number | |
| // Example: n = 10 | |
| // Output: 0,1,1,2,3,5,8,13,21 | |
| int num1 = 0; | |
| int num2 = 1; | |
| int sum = 0; | |
| int count = 10; | |
| List<int> fibSeries = []; | |
| fibSeries.add(num1); | |
| fibSeries.add(num2); | |
| void printFibonacciWay1(int count) { | |
| for (int i = 2; i < count; i++) { | |
| int sum = num1 + num2; | |
| num1 = num2; | |
| num2 = sum; | |
| fibSeries.add(sum); | |
| } | |
| } | |
| void printFibonacciWay2(int count) { | |
| if (count > 0) { | |
| sum = num1 + num2; | |
| num1 = num2; | |
| num2 = sum; | |
| fibSeries.add(sum); | |
| printFibonacciWay2(count - 1); | |
| } | |
| } | |
| printFibonacciWay1(count); | |
| //printFibonacciWay2(count - 2); | |
| print(fibSeries.toString()); | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment