Recursion explained

Illustrative flowchart of our recursive function

Our main function isn’t happy until our y value equals 0. To evaluate this condition it runs through a series of if statements that, if triggered, will modify the value of y, adding or subtracting accordingly. Our function is called over and over again until it is satisfied. Eventually our function calls itself again a last time, having reached the final value of x = 0 and y = 0, it can finally rest.




Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

Generate Javascript API Client from OpenAPI Specification

How loading JavaScript can slow websites down (even if it’s asynchronous)

Angular Material — Stepper

Weekly Jobs Update — Apr 7, 2020

Build a Progressive Web App with Angular

Designing a Scalable API Rate Limiter in Node.js Application — Cloudnweb

SAP Tutorial: Complete CAP Java 14

How to UI in 2018

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Gabriel Vazquez

Gabriel Vazquez

More from Medium

IPL Match Winner Prediction using Machine Learning

What is the Confusion Matrix in Machine Learning? What are Type 1 and Type 2 Error?

What’s happen when you type ls -l *c

Sigmoid Activation function