Is using recursion for finding Nth Fibonacci a more efficient way

As we have already solved the problem of finding Nth Fibonacci number in the previous section but I want to know if using recursion to do the same is anyway better?