Skip to content

Fibonacci Series using recursive function and non-recursive function

License

Notifications You must be signed in to change notification settings

sgowda97/fibonacci-java

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 

Repository files navigation

fibonacci-java

Fibonacci Series using recursive function and non-recursive function

What is fibonacci series?

Here, the next number is the sum of previous two numbers. The first two numbers are always 0 and 1.

HOW-TO

  • Fibonacci series can be achieved in two ways:
    • Recursive
    • Non-recursive
  • A method which keeps calling itself is called recursive
  • Assuming you want to use non-recursive, while in the directory in CLI, type:
    • javac FibonacciSeries.java
    • java FibonacciSeries
  • Follow the instructions

About

Fibonacci Series using recursive function and non-recursive function

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages