--Originally published at OlafGC / Class #TC1017
Hello dear friends! A quick tutorial on how to solve the fourth question of the exam. I hope you find this very useful and thanks for watching!
Code:
#include <iostream>
using namespace std;
int fibonacci(int n)
{
int fib=1, pre=0;
for(int accu=0; accu<n; accu++)
{
fib+=pre;
pre=fib-pre;
} return fib;
}
int main()
{
int res,n;
cout<<“Dame número “<<endl;
cin>>n;
res=fibonacci(n);
cout<<“Tu fibonacci es “<<res<<endl;
return 0;
}
--Originally published at It's me
Fibonacci series… They’re quite interesting. Given a number the program will display all the fibonacci serie until the number the user gives, you’ll see the example in the code running. Basically I used the “formula” in this web page and with some help of a friend we could made it. We create the function fibonacci(int i) and the rest was just ifs and for. Here is the code:
--Originally published at Alvaro_246
En el Quiz de la semana numero 8, Trabajamos con la sucesión de Fibonacci e hicimos un programa que nos mostrara la seria de Fiboncci hasta un numero determinado que el usuario ingrese. Para ello hice una funcion llamada fibonacci la cual recibe un numero entero que va a ser igual al limite de la serie. void fibonacci(int numero){}. Dentro de la función puse un “while” con la condición de que el numero que ingrese el usuario no puede ser <0. La funcion fibonacci contiene la siguiente formula para la serie de Fibonacci :
while(Base <=numero){
cout << Base << “,” ;
x1 = x2;
x2 = Base;
Base = x1 + x2;
}
Código y Resultados:
--Originally published at Ken's Disciple 01
Unsplash
Hello everyone! Welcome to Quiz 08’s Blog post. In this quiz we actually had to do two programs about the same thing, giving the ‘nth’ fibonacci number. This program was actually very easy to do if you had the correct information. So the first program was about doing a loop and the second one was doing a recursion, which basically is doing a function that calls itself (I know it sounds weird, but you should probably check the book, check where it says recursions).
I highly recommend reading the book (because it also gives the example of fibonacci numbers with recursions, it’s section 5.12) and also if you want your program to support a wider range of values you may want to use long long variables and also unsigned, which basically means that the variable won’t work with negative numbers; giving you more space to work with positive numbers.
So let’s get started, here are my two programs:
As you may have seen I timed both programs in order to conclude this: The recursion program may look more “elegant”, since it’s smaller and also may be easier to understand, and it may occupy less space in memory. Also the loop one is more “efficient”, since it takes less time to perform the calculations, and believe me, if you try with bigger numbers time will be way faster with the loop one. So in conclusion, I think that the space we will save with recursions is not that much of a difference as time, so I thing the loop one is the better one to work with.
As always my codes at GitHub:
Loop
Recursion
If you have questions, feel free to ask.
l.out
--Originally published at Adal´s Blog
--Originally published at Solving Problems with Programming
PICTURE OF AUTOR
THIS IS THE #QUIZ8 WHOSE OBJECTIVE IS CREATE AND CALL FUNCTIONS TO DO DIFFERENT TASKS AT DIFFERENT TIMES USING RECURSION AND LOOPS. COVERING #MASTERYTOPIC06 #MASTERYTOPIC07 . This IS ALSO to fulfill the #Mastery12 Use of recursion for repetitive algorithms
This #QUIZ08 makes first a survey where I gave some advice or feedback to ken bauer in how i am learning in this course. Next, in this quiz 8 makes a function that calculates and returns the “nth” Fibonacci number where we define a function over the Fibonacci numbers mapping the naturals (starting with zero) to the Fibonacci series.
Link of the picture:Link of the picture
So fibonacci(0) returns 0, fibonacci(1) returns 1, fibonacci(2) returns 1 and so on. Note that we are using the modern definition where the sequence starts with zero. I tried to implement this with two solutions: one with a loop and one with recursion. Which do I think is “better”, which looks more “elegant”, which is more “efficient”?
First let me show you the pictures of the quiz:
FIRST TO DO IN THIS #QUIZ08 with the recursion solution is writing a function called ‘fibonacci(int n)’ with an int parameter called n where this parameter is the value of the list in the serie.
Inside of this function, we have a condition a #Mastery10 use of the if statement. This command allows the condition if the value of n is equal to 0 or 1 when this condition will be true, the tasks inside of the statement will execute. In this case if the value of n is equal than 0 or 1 this will occur:
return n; //With this command you return the value of the int variable n in order to show it in THE MAIN FUNCTION
return n; //With this command you return the value ofContinue reading "#Quiz08 See the algorithm of Fibonacci serie explained!"
--Originally published at TC1017
The quiz from week 8 consisted in creating a program that returned the value typed by the user of the fibonacci series. Ken gave us a very clear explanation of how the series worked and it was pretty easy to deduce how the program would work. I spent half of the class debugging the code and making sure the values were correct. The code is below.
--Originally published at my programming blog
Today I had to do the quiz #8 which was to create a function where I needed to calculate the nth number in the Fibonacci sequence. I had a lot of trouble with this quiz!!!!! I didn’t go to class, so I couldn’t ask to my classmates or to Ken, so I searched for a lot of examples and tutorials of different codes for this program and with what I understood I created my own program.
What I did was:
I hope you understand it! If not here are some examples of different codes and a tutorial that can give you an idea to create your own code. Also check the work of our classmates in
--Originally published at Programming course
In this assignment we saw the number series of Fibonacci, which is basically a mathematical explanation to many things in nature, such as the spirals found in flowers, plants, etc, and the numerical sequence in them. In the program we made, using a loop I told the user the series. This is the code I used.
And if you want to know more about Fibonacci in art, you can click here and there is a great easy slideshow.
Pictures used:
https://www.flickr.com/photos/snlsn/
--Originally published at Let's CODE
