Iterative version of fibonacci sequence

Dependencies:   mbed

Committer:
saltire78
Date:
Sat Dec 05 12:55:13 2020 +0000
Revision:
1:0ce8847b93cf
Parent:
0:8f9265fb1552
.

Who changed what in which revision?

UserRevisionLine numberNew contents of line
saltire78 1:0ce8847b93cf 1 #include"mbed.h" //mbed header folder
saltire78 0:8f9265fb1552 2
saltire78 1:0ce8847b93cf 3 Serial pc(USBTX,USBRX); //tx,rx
saltire78 1:0ce8847b93cf 4
saltire78 1:0ce8847b93cf 5 int main() { // start main program
saltire78 1:0ce8847b93cf 6 int i, iter, fibSum; // define unknown integers
saltire78 1:0ce8847b93cf 7 int fib1 = 0, fib2 = 1; // define known Fibonacci values
saltire78 1:0ce8847b93cf 8
saltire78 1:0ce8847b93cf 9 pc.printf("Number of iterations: "); // ask for number of iterations
saltire78 1:0ce8847b93cf 10 scanf("%d", &iter); // input number of iterations
saltire78 1:0ce8847b93cf 11 pc.printf("\n\rFibonacci Series(%d iterations): ",iter); //print statement
saltire78 0:8f9265fb1552 12
saltire78 1:0ce8847b93cf 13 for (i = 1; i <= iter; ++i) { // begin loop for selected number of iterations
saltire78 1:0ce8847b93cf 14 pc.printf("%d ", fib1); // print the lowest value known at that time
saltire78 1:0ce8847b93cf 15 fibSum = fib1 + fib2; // create the next known value for the sequence
saltire78 1:0ce8847b93cf 16 fib1 = fib2; // shift the 2nd known Fibonacci value to lowest value
saltire78 1:0ce8847b93cf 17 fib2 = fibSum; // shift the highest known Fibonacci value to 2nd known value
saltire78 1:0ce8847b93cf 18
saltire78 0:8f9265fb1552 19 }
saltire78 1:0ce8847b93cf 20
saltire78 1:0ce8847b93cf 21 pc.printf("\n\n\r"); // cosmetic - moves the carriage to new line so if reset for further values it will be clearly seperate
saltire78 1:0ce8847b93cf 22
saltire78 1:0ce8847b93cf 23 return 0; // close out the program
saltire78 1:0ce8847b93cf 24 }