(4485 Views)

A series of numbers in which each number is the sum of the two preceding or previous numbers is called Fibonacci Series.

For example, Fibonacci series upto 6 numbers is 1, 1, 2, 3, 5, 8, etc.

- Algorithm For Prime Number
- Algorithm for Insertion Sort
- Selection Sort Algorithm and Flowchart
- Binary Search Algorithm
- Algorithm for Factorial of a Number

6 UpvotesUpvote |
4 DownvotesDownvote |

- Writable Streams in Javascript [989 Views]
- Algorithm and Flowchart for Postfix to Infix Notation [1358 Views]
- Flowchart and Algorithm for N Queen Problem [1263 Views]
- Bellman-Ford Algorithm with Example [8666 Views]
- How to convert the number into Characters in a sentence using C++ [183 Views]

- Algorithm to find whether number is Armstrong Number or Not [40208 Views]
- How To Win Ludo King Game Every Time [39334 Views]
- Jio Phone hang on LOGO problem Solution - Hard Reset Jio Phone [27644 Views]
- Knuth-Morris-Pratt (KMP) Substring Search Algorithm with Java Example [27544 Views]
- FlowChart and Algorithm to find Whether a Number is Even or Odd [20020 Views]