Ejercicio en Prolog PDF

Preview

Summary

Ejercicion en codigo...

Description

def fib4(n: Int): Int = { def fib_tail(n: Int, a: Int, b: Int): Int = n match { case 0 => a case _ => fib_tail(n - 1, b, a + b) } return fib_tail(n, 0 , 1) } def main(args: Array[String]): Unit ={ println("Fibonacci 1: " + fib1(7)) println("Fibonacci 2: " + fib2(2)) println("Fibonacci 3: " + fib3(5)) println("Fibonacci 4: " + fib4(3)) } }

/* Serie de Fibonacci 0 1 1 2 3 5 8 13 21 34 55..... */ object Fibonacci{ def fib1(n: Int): Int = { if ( n == 0 ) 0 else if ( n == 1 ) 1 else fib1( n-1 ) + fib1( n-2 ) } def fib2(n: Long): Long = n match { case 0 | 1 => n case _ => fib2(n - 1) + fib2(n - 2) } def fib3(n: Long): Long = { var first = 0 var second = 1 var count = 0 while(count < n){ val sum = first + second first = second second = sum count = count + 1 } return first } def fib4(n: Int):...