Tail recursive version of fibonacci:
func fibTail(_ n: Int, _ a: Int = 0,_ b: Int = 1) -> Int{
if n == 0 { return a }
if n == 1 { return b }
return fibTail(n-1,b,a+b)
}
fibTail(10)Tail recursive version of fibonacci:
func fibTail(_ n: Int, _ a: Int = 0,_ b: Int = 1) -> Int{
if n == 0 { return a }
if n == 1 { return b }
return fibTail(n-1,b,a+b)
}
fibTail(10)