Home »
» Example Of Fibonaci Sequence
Unknown 11:04:00 AM
Example Of Fibonaci Sequence:
The celebrated Fibonacci sequence (usually denoted by F0, F1, F2,...........) is as follows:
0, 1, 1, 2, 3, 5, 8, 12 , 21 ,34 , 55,...............
That is F
o = 0 and F1 = 1
So, 34+55 = 89 and 55+89 = 144
A normal defination of this function
(Fibonacci Sequence)
(a) If n = 0 or n = 1. then Fn = n.
(b) If n > 1 , then Fn = Fn-2 + Fn-1
Related Posts:
Shortest Path Algorithm
(Shortest Path Algorithm) A directed graph G with M nodes is maintained in memory by
its weight matrix W. This algorithm finds a matrix Q such that Q[I,J] is the length of a shortest path from node VI tonode VJ.Infin… Read More
(Matrix Multiplication) MATMUL(A, B, C, M, P, N)
(Matrix Multiplication) MATMUL(A, B, C, M, P, N)
Le A be an M * P matrix array, and let B be a P * N matrix array. This algorithm stores the product of A and B in an M * N matix array C.
1. Repeat Steps 2 to 4 for I… Read More
What is Overflow?
Overflow: Sometimes new data are to be inserted into a data structure but there is no available space , i.e, the free-storage list is empty.This situation is called overflow.
If You want to learn about the techn… Read More
What is underflow?
Underflow: The term underflow refers to the situation where one wants to delete data from a data structure that is empty, The programmer may handle underflow by printing the message UNDERFLOW
If You want to learn abou… Read More
Warshall's Algorithm
(Warshall's Algorithm) A directed graph G with M nodes is maintained in memory by its adjacency matrix A. This algorithm finds the (Boolean) path matrix P of the graph-G
1. Repeat for I, J = 1, 2......, M: [In… Read More
0 comments:
Post a Comment