Define how recursion works

Recusion works by creating a method which is defined in terms of itself. This effectively means that the method will make method calls to itself. It makes these calls using increasingly reduced problem sizes as arguments, until a base case is reached. These method calls are stored in a stack, and when the base case is reached, the stack is evaluated, as they are, in a last-in-first-out order, leading to a final result.

MK
Answered by Maximilian K. Computing tutor

1655 Views

See similar Computing IB tutors

Related Computing IB answers

All answers ▸

Name the memories in the computer and rate them by the amount of space and their price. When should which be used.


What is encapsulation?


What is data validation and data verification?


Explain the difference between the cache memory and the buffer.


We're here to help

contact us iconContact ustelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

© MyTutorWeb Ltd 2013–2025

Terms & Conditions|Privacy Policy
Cookie Preferences