0
In a Fibonacci sequence, the previous two numbers are added to generate the next Fibonacci number.
F1=1st number
F2=2nd number
F3=f1+f2=1+2=3
F4=f2+f3=2+3=5
F5=f3+f4=3+5=8, and so on.
f1 f2 f3 f4 f5 f6 f7..............
1 2 3 5 8 13 21.............
In algorithm:
1. Assign sum=0, A=0, B=1, i=1
2. Get the no. of terms upto which u want to generate the Fibonacci no, i.e., n.
3.Add A and B to get the next Fibonacci number
4. Assign the value of B to A i.e. A=B
5. Assign the value of sum to B i.e. B=sum
6. Write the value of su to get next Fibonacci number in the series.
7. increment i with 1 i.e. i=i+1 and repeat step 3,4,5,6 with the last value of i=n(n is the no. of terms which u wnt to generate Fibonacci no. series.)
8. Stop
the fibbonacci series is defined as each member is the sum of the last 2 members, satrting with 1,1.
prev = 0
curr = 1
startLogic
display curr
next = prev + curr
prev = curr
curr = next
goto startLogic
will output the fibbonacci series.
WRITE 'Input the limit'
READ N
FOR i = 1 TO N DO
IF (i = 1)
F1 = 1
WRITE (F1)
ELSE IF (i = 2)
F2 = 1
WRITE (F2)
ELSE
F3 = F1 + F2
WRITE (F3)
F1 = F2
F2 = F3
END IF-ELSE
END FOR
1.start
2.a=0,b=1,c and counter
3.display a
4.display b
5.c=a+b
6.display c
7.a=b
8.b=c
9.check whether number is less than the last number you have
if yes than go to step 5
if no stop it
1.start
2.a=0,b=1,c and counter
3.display a
4.display b
5.c=a+b
6.display c
7.a=b
8.b=c
9.check whether number is less than the last number you have
if yes than go to step 5
if no stop it
Read more: Draw_a_flow_chart_that_displays_the_Fibonacci_series
///////////////////////////////
In psuedocode:
///////////////////////////////
prevnum = 0;
num = 1;
while not done {
print num
num += prevnum
prevnum = num - prevnum
}
/****** in C: ******/
#include <stdio.h>
#define SEQUENCE_LENGTH 10
int main( int argc, char *argv[] ){
int prevnum = 0, n;
int num = 1;
for(n = 0; n < SEQUENCE_LENGTH; n++){
printf("%i ", num);
num += prevnum;
prevnum = num - prevnum;
}
return 0;
}
Add your answer:
Earn +20 pts
What is algorithm to write algorithm to the program to access a pointer variable in structure?
Here is the algorithm of the algorithm to write an algorithm to access a pointer in a variable. Algorithmically.name_of_the_structure dot name_of_the _field,eg:mystruct.pointerfield
Write flowchart searching algorithm?
flow chart to swap two number
Where do you run an algorithm?
By preparing test cases we can test an algorithm. The algorithm is tested with each test case.
A Write the algorithm to concatenate two given strings?
a write the algorithm to concatenate two given string
Write an algorithm and draw a corresponding flowchart to search a number in the given list of numbers and also display its position?
please give me an algorithm and a corresponding flow chart that displays list of numbers from 1 to 20.
Write an algorithm to check whether a number is a prime number or not?
You can write out this algorithm. This will then be programmed into the device to make determining prime numbers easier.
Can you write an algorithm to find the greatest of three number using class?
Yes. But why?
What is algorithm to write algorithm to the program to access a pointer variable in structure?
Here is the algorithm of the algorithm to write an algorithm to access a pointer in a variable. Algorithmically.name_of_the_structure dot name_of_the _field,eg:mystruct.pointerfield
Write an algorithm to find the root of quadratic equation?
Write an algorithm to find the root of quadratic equation
Write flowchart searching algorithm?
flow chart to swap two number
How to write an algorithm that accepts five numbers and displays the sum and average of the numbers?
1.Start Algorithm 2.Enter first number 3.Enter second number 4.Enter third number 5.Enter fourth number 6.Enter fifth number 7.Add five number 8.display five number / 2 9.Display result 10.End Algorithm
Where do you run an algorithm?
By preparing test cases we can test an algorithm. The algorithm is tested with each test case.
Write the algorithm and draw the flowchart to find Sum of N Prime number?
Ah, finding the sum of N prime numbers is a lovely challenge! You can create an algorithm by first defining a function to check if a number is prime, then loop through numbers starting from 2 and add the prime numbers to a running sum until you reach N prime numbers. For the flowchart, you can start with a start/end symbol, then use decision symbols to check if a number is prime, loop symbols to iterate through numbers, and a process symbol to calculate the sum. Remember to add symbols for input and output as well. Happy algorithm painting!
A Write the algorithm to concatenate two given strings?
a write the algorithm to concatenate two given string
How do you write an Algorithm for a C plus plus Program?
You don't write an algorithm for a C++ program, unless you are documenting the C++ program after-the-fact. The normal procedure is to write the algorithm first, in a language independent fashion, and then translate that stated algorithm into C++ code, or into whatever language you wish.
Write an algorithm to check whether the given number is odd or even?
Type your answer here... i think we should first enter 1 number then check it
Design step by steps algorithm on how to write the letter A and display the result?
Design step by steps algorithm on how to write the letter A and display the result
