I'll be explaining recursion utilizing Euclid's Algorithm for finding the greatest common denominator when both variables are greater than zero.
Recursion is a mathematical procedure that utilizes a procedure or definition within itself to develop a solution. Now if you're anything like me, reading that statement just appears as a bunch of wordplay. Truth is, recursion is a difficult topic to understand during your initial encounter with it but as time progresses and your experience using recursion grows, you'll grasp the concept with ease and be able to implement recursive solutions into your own code.
Before we start, it's worth mentioning that there are several great articles discussing recursion and the fundamentals of the topic. In writing this, I'm not only providing a tutorial on how recursion works to find the GCD but also assisting myself in completely grasping the concept. I do recommend working through a problem