-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path5.3.scala
32 lines (28 loc) · 861 Bytes
/
5.3.scala
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
object Fibonnaci{
def fibonacciRecursive(n: Int):Int = {
if(n<=1) n
else fibonacciRecursive(n-1) + fibonacciRecursive(n-2)
}
def fibonnacciIterative(n: Int): List[Int] ={
require(n>=0, "Number of terms must me non-negative")
if(n==0) List(0)
else if (n==1) List(0,1)
else{
var fibs: List[Int] = List(0,1)
for(i<- 2 until n){
fibs = fibs :+ (fibs(i-1) + fibs(i-2))
}
fibs
}
}
def printFibonacci(n: Int): Unit ={
val fibs = fibonnacciIterative(n)
println(s"The first $n Fibonacci numbers are:")
fibs.foreach(println)
}
def main(args: Array[String]): Unit = {
println("Enter the number of Fibonacci terms to generate:")
val n = scala.io.StdIn.readInt()
printFibonacci(n)
}
}