Hello Guys, Today is this article we are taking about Recursion.
We are solving and understanding a problem by using Recursion in JavaScript.
π Problem :- Find odd-even number using Recursion ?
Let's start today's article...
β’ What is recursion?
=> Recursion mean calling itself till condition not true. A function call itself that's function called Recursive function.
β’ How to find odd even number in JavaScript?
=> We are finding odd-even number by dividing 2. When the reminder is 0 it's mean the number is even or reminder is 1, it is odd number. Right...
We are using same logic in today's solving problem using recursion but different.
π Let's start solving problems
β’ First we create a function and pass one parameter. As following π
β’ We are using same logic as we use always to find odd even number but in this problem we are consider if the parameter's value is 0 it is even or if it's value is 1 it means number is odd.
β’ See following code to better understand, we are using if-else condition. π
β’ Now time to use recursion function but before using recursion we simply decrease parameter 'num' value by 2.
Because odd and even number difference is 2 for example 1 and 3 difference is 2 and also 2 and 4 difference is 2. See below π
β’ In the above code, in a line number 14 we are calling a function that's mean it will call itself till when given condition not true.
β’ Let's check the output π
π Thanks for reading...
π Stay with us for more....
Top comments (3)
Thanks for reading...
I was solving by using recursion above problem. That's why it's long solution.
If you want to make a new article, going down each sub array in an array (branches of a tree) would probably be a more useful scenario as well as more illustrative to the naivity of depth/iterarions π€
The author could write another post on trampolining to show how to avoid this