Write a recursive function called fib which accepts a number and returns the nth number in the Fibonacci sequence. Recall that the Fibonacci sequence is the sequence of whole numbers 1, 1, 2, 3, 5, 8, ... which starts with 1 and 1, and where every number thereafter is equal to the sum of the previous two numbers.
Write a recursive function called fib which accepts a number and returns the nth number in the Fibonacci sequence. Recall that the Fibonacci sequence is the sequence of whole numbers 1, 1, 2, 3, 5, 8, ... which starts with 1 and 1, and where every number thereafter is equal to the sum of the previous two numbers.
Write a recursive function called flatten which accepts an array of arrays and returns a new array with all values flattened.
Write a recursive function called flatten which accepts an array of arrays and returns a new array with all values flattened.
Write a function factorial which accepts a number and returns the factorial of that number. A factorial is the product of an integer and all the integers below it; e.g., factorial four ( 4! ) is equal to 24, because 4 3 2 \* 1 equals 24. factorial zero (0!) is always 1.
Write a function factorial which accepts a number and returns the factorial of that number. A factorial is the product of an integer and all the integers below it; e.g., factorial four ( 4! ) is equal to 24, because 4 3 2 \* 1 equals 24. factorial zero (0!) is always 1.
Write a recursive function called isPalindrome which returns true if the string passed to it is a palindrome (reads the same forward and backward). Otherwise it returns false.
Write a recursive function called isPalindrome which returns true if the string passed to it is a palindrome (reads the same forward and backward). Otherwise it returns false.
Write a function called power which accepts a base and an exponent. The function should return the power of the base to the exponent. This function should mimic the functionality of Math.pow() - do not worry about negative bases and exponents.
Write a function called power which accepts a base and an exponent. The function should return the power of the base to the exponent. This function should mimic the functionality of Math.pow() - do not worry about negative bases and exponents.
Write a function called productOfArray which takes in an array of numbers and returns the product of them all.
Write a function called productOfArray which takes in an array of numbers and returns the product of them all.
Write a function called recursiveRange which takes in an array of numbers and returns the product of them all.
Write a function called recursiveRange which takes in an array of numbers and returns the product of them all.
Write a recursive function called reverse which accepts a string and returns a new string in reverse.
Write a recursive function called reverse which accepts a string and returns a new string in reverse.
Write a recursive function called someRecursive which accepts an array and a callback. The function returns true if a single value in the array returns true when passed to the callback. Otherwise it returns false.
Write a recursive function called someRecursive which accepts an array and a callback. The function returns true if a single value in the array returns true when passed to the callback. Otherwise it returns false.
Write a recursive function called sumRecursion which accepts an array and a callback. The function returns true if a single value in the array returns true when passed to the callback. Otherwise it returns false.
Write a recursive function called sumRecursion which accepts an array and a callback. The function returns true if a single value in the array returns true when passed to the callback. Otherwise it returns false.