Recursive Fibonacci Sequence Calculation

This function calculates the nth term of the Fibonacci sequence using recursion.

Technology Stack : math, re, sys, time, threading

Code Type : Recursive function

Code Difficulty : Intermediate

                
                    
import math
import re
import sys
import time
import threading

def fibonacci(n):
    def helper(a, b, n):
        if n == 0:
            return a
        return helper(b, a + b, n - 1)

    return helper(0, 1, n)