Week 1

Question 1

What is tail recursion

Answer 1

A form of linear recursion where the recursive step is applied last

Question 2

Why is tail recursion more efficient

Answer 2

Since the recursive step is applied last there are no following operations that we need to deal with

Since we only care about the final state(current state) all previous states can be disregarded